Lists A jump list is a doubly linked list data structure where the elements are kept in sorted order However, nodes in a jump list have additional forward and backward links (the so-called jump pointers') that allow one to rapidly transverse the list each of these 'special' forward and backward links skip many items in the list, allowing for faster element access. We'll assume the list has n elements. Given an element at position i in the list, it still has the regular doubly linked list links to -1 and i+1. There are also jump links, one forward and (possibly) one backward The forward jump link for an element at position i is to the element at position i Vi], where Vi is the cube root of i. Thus, the element at position 27 has a forward jump link to position 30, since 3 is the cube root of 27. The element at position 80 will have a forward jump link to position 84, since 4 is the floor of the cube root of 80 ( 80 = 4.3088). All nodes have forward jump links. The backward jump link follows a different pattern, however. If the position has an integer cube root (i.e., is one of 13, 23, 33, 43, etc.), then it has a backward jump link to the previous cube root. Thus, the element at position 64 (43) has a backward jump link to the element at position 27 (3). Any position that does not have an integer cube root does not have a backward jump link to go backwards from that position, you have to move forward to the next position that is an integer cube root, and then start following the backward jump links to move backwards. 5. [8 points] What is the (big-theta) running time of search, insert, and delete for a jump list? Briefly explain why in each case.l 6. [8 points] What are the benefits of this data structure? What are the drawbacks