What are the worst-case time complexities of insert and find operations in a dictionary ADT, where n is the size of the dictionary?ALL these three questions, and brief explanation

1. What are the worst-case time complexities of insert' and 'find' operations in a dictionary ADT, where n is the size of the dictionary? b) O(n) & O(n) c) O(1) & O(n) d) O(n) & O(1) 2. Which of the following sorting algorithms has the lowest worst-case time complexity? a) Selection sort b) Insertion sort c) Bubble sort d) Heap sort JL 3. Which of the following sorting algorithms is not stable (i.e., the initial ordei equal keys is maintained)? a) Selection sort b) Insertion sort c) Bubble sort d) All sorting algorithms are stable