4 multiple questions, you do not need to explain the answers. Thank you

What is the worst case time complexity of the algorithm shown in the picture below: MERGE(A, p, q,r) n = 9- p + 1 n2 = r-9 let L[l..ni + l) and R[1..n2 + 1] be new arrays for i = 1 to ni L[i] = A[p + i - 1] for j = 1 to n2 R[j] = A[9 + j] L[n + 1] R[n2 + 1] i = 1 j = 1 for k = p to r if L[i]