2. Short Answers. Assume n is the size of array for the following questions. Describe the complexity in big-O notation. (19 pts) a. What is the worst case complexity for any algorithm to find an item in an unsorted array? (4 pts) b. What is the complexity of reversing an array? (5 pts) c. What is the complexity of inserting a number to the start of an array? What is the complexity of inserting a number to the end of an array? (6 pts) d. What is the complexity of finding the medium of a sorted array? (4 pts)