Given the following pseudocode.

Convert into a C++ program.

Sort(A, N)

for j 2 to N

key A[j]

i j - 1

while i > 0 and A[j] > key

A[i+1] A[i]

i i 1

exchange A[i+1] key