1. (20 points) Write a simple method using pseudo code for each of the following algorithmic time complexities. a) 0(1) b) O(logn) c) O(n3) d) O(nlogn) 1. The following array is given: 12 92 67 33 32 75 80 a. Apply the merge sort to the array above by showing the steps on a diagram and describe briefly. (10 points) b. Apply the quick sort to the array above by showing the steps on a diagram and describe briefly. (10 points) c. Compare Merge sort and Quick sort algorithms. (10 points)