Suppose that you want to find the largest element in an unsorted array of n elements. Algorithm A searches the entire array sequentially and keeps track of the largest element seen thus far. Algorithm B sorts the array using mergesort, and then reports the last element as the largest. 1. What is the big-O time efficiency of Algorithm A in the best, average, and worst cases? Explain your answer briefly. (You do not need to implement either algorithm. We just want you to analyze them.) 2. What is the big-O time efficiency of Algorithm B in the best, average, and worst cases? Explain your answer briefly. 3. Which algorithm is faster? Explain briefly