(Solved): Merge Algorithm Access the first item from both sequences. while not finished with either sequence ...

Merge Algorithm Access the first item from both sequences. while not finished with either sequence Compare the current items from the two sequences, copy the smaller current item to the o utput sequence and access the next item from the input sequence whose item was copied. Copy any remaining items from the first sequence to the output sequence. Copy any remaining items from the second sequence to the output sequence. If we have an array of size \( \boldsymbol{n} \) that is used as input to the mergeSort) function, 1. What should be the values for the start and end parameters for the initial call to mergesort?? Assume array is 0 indexed and state your answers in terms of size, \( n \). A. start: B. end: 2. What is the time complexity of a single merge() operation in the worst case in terms of Big 0 notation? State your answers in terms of size, \( n \). e.g. \( O\left(n^{2}\right) \) 3. The maximum number of stack frames for the mergeSort() at any given point of time in terms of Big O notation will be: State your answers in terms of size, n. e.g. \( O\left(n^{2}\right) \)