Attached is the pseudocode for the Merge algorithm. When this algorithm is called with Merge (A, 1, 4, 8) with A = (4, 6, 8, 9, 2, 5, 10, 12), how many times does line 15 execute? How many times does line 17 execute? How many times does line 22 execute? How many times does line 26 execute?

1234567891011121314151617181920remainderoftheothertotheendofA[p:r]nL=qp+1//lengthofA[p:q]nR=rq//lengthofA[q+1:r]letL[0:nL1]andR[0:nR1]benewarraysfori=0tonL1//copyA[p:q]intoL[0:nL1]L[i]=A[p+i]forj=0tonR1//copyA[q+1:r]intoR[0:nR1]R[j]=A[q+j+1]i=0//iindexesthesmallestremainingelementinLj=0//jindexesthesmallestremainingelementinRk=p//kindexesthelocationinAtofill//AslongaseachofthearraysLandRcontainsanunmergedelement,copythesmallestunmergedelementbackintoA[p:r].whilei