1. State the greatest possible lower bound that you can for the all-pairs shortest paths problem, and justify your answer.
2. Show the Skip List that results from inserting the following values. Draw the Skip List after each insert. With each value, assume the depth of its corresponding node is as given in the list.
