5. List maintenance (I. Consider the problem of maintaining a collection of lists of items on which the following operations can be performed: (G) Create a new list with one item. (ii) Given two lists L1 and L2, form their concatenation L, i.e., the list consisting of all items in L1 followed by all items in L2 (destroying L1 and L2 in the process). (ii) Given a list L and a positive integer k, split L into two lists L1 and L2, where L1 consists of the first k items of L, and L2 the rest (L is destroyed in the process). (iv) Given a list L and a positive integer k, report the kth item in L Describe data structures and algorithms supporting these operations so that operation (i) takes constant time, and operations (ii (iv) can be performed in time O(logn) (where n is the length of L). Hint: Use a variation on 2-3 trees. Be sure to specify what information is stored at each node. Just sketch the algorithms, emphasizing the similarity and differences with algorithms for ordinary 2-3 trees. 5. List maintenance (I. Consider the problem of maintaining a collection of lists of items on which the following operations can be performed: (G) Create a new list with one item. (ii) Given two lists L1 and L2, form their concatenation L, i.e., the list consisting of all items in L1 followed by all items in L2 (destroying L1 and L2 in the process). (ii) Given a list L and a positive integer k, split L into two lists L1 and L2, where L1 consists of the first k items of L, and L2 the rest (L is destroyed in the process). (iv) Given a list L and a positive integer k, report the kth item in L Describe data structures and algorithms supporting these operations so that operation (i) takes constant time, and operations (ii (iv) can be performed in time O(logn) (where n is the length of L). Hint: Use a variation on 2-3 trees. Be sure to specify what information is stored at each node. Just sketch the algorithms, emphasizing the similarity and differences with algorithms for ordinary 2-3 trees