• That's the whole statement of the problem

• You can describe the algorithm and program language is no necessary

5. (a) Insert the numbers {50, 45, 55, 40, 60, 35, 65, 30.70, 25,75} into an initially empty SkipList. Use the insert algorithm described in class. The values of k (as defined in the slides) you use are using are 1, 2, 3, 4, 1.2.3, 4.... (So for example 40 participates in 4 levels, and 60 in one level). Show the result after each insertion into level 4. (b) Build a perfect SkipList for the data of Question 5a. You just need to submit the result. 5. (a) Insert the numbers {50, 45, 55, 40, 60, 35, 65, 30.70, 25,75} into an initially empty SkipList. Use the insert algorithm described in class. The values of k (as defined in the slides) you use are using are 1, 2, 3, 4, 1.2.3, 4.... (So for example 40 participates in 4 levels, and 60 in one level). Show the result after each insertion into level 4. (b) Build a perfect SkipList for the data of Question 5a. You just need to submit the result