Consider using a dictionary implemented as a single linked list. Assume the client will never provide duplicate elements, so we can just insert elements at the beginning of the list. Now assume the peculiar situation that the client may perform any number of insert operations but will only ever perform at most one lookup operation 5. What is the worst-case running-time of the operations performed on this data structure under the assumptions above? Briefly justify your answer. Explanation of Worst Case times: What is the worst-case amortized running-time of the operations performed on this data structure under the assumptions above in part 2(a)? Briefly justify your answer. Explanation of worst-case amortized running