(Solved): java algorithms  Divide \& Conquer Sorts: The diagram below shows the recursive method calls of ...

Divide \& Conquer Sorts: The diagram below shows the recursive method calls of the merge sort algorithm. The routine repeatedly divides the input array into two sub-arrays and recurses until only a single element remains (the base case). Choose the correct order in which each recursive call completes, as labelled in the diagram. Hint: A recursive call only completes if we reach a base case or the merge() operation completes. \( H, I, D, J, K, E, B, L, M, F, N, O, G, C, A \) \( H, I, J, K, D, E, B, L, M, N, O, F, G, C, A \) H, I, J, K, L, M, N, O, D, E, F, G, B, C, A A, B, C, D, E, F, G, H, I, J, K, L, M, N,O