Can you please help me with this question?

3. Consider the following 22 x22 matrix: 9 10 13 14 11 12 15 16 its Morton order is 1,2,3, 4,5, 6,7,8,9,10, 11, 12, 13, 14, 15, 16. The following 23 x 23 matrix: 1 256 1 25 6 3 478 3 4 78 9 10 13 14 9 10 13 14 11 12 15 16 11 12 15 16 1 25625 6 3 4 7 8 3 4 7 8 9 10 13 14 9 10 13 14 11 12 15 16 11 12 15 16 has Morton order 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 13, 14, 15, 16, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 14, 15, 16. Given a 2n 2n matrix, write a recursive divide-and-conquer algorithm to print it in Morton order. Also find and solve the recurrence for the running time of your algorithm. 3. Consider the following 22 x22 matrix: 9 10 13 14 11 12 15 16 its Morton order is 1,2,3, 4,5, 6,7,8,9,10, 11, 12, 13, 14, 15, 16. The following 23 x 23 matrix: 1 256 1 25 6 3 478 3 4 78 9 10 13 14 9 10 13 14 11 12 15 16 11 12 15 16 1 25625 6 3 4 7 8 3 4 7 8 9 10 13 14 9 10 13 14 11 12 15 16 11 12 15 16 has Morton order 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 13, 14, 15, 16, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 14, 15, 16. Given a 2n 2n matrix, write a recursive divide-and-conquer algorithm to print it in Morton order. Also find and solve the recurrence for the running time of your algorithm