Please explain the solution.

The following swap procedure, written in C, is the basic block of any sorting program. void swap (long long int v[], long long int k) long long int temp; temp = v[k]; v[k] = v[k+1]; v [k+1] = temp; Write the ARM LEGv8 code for the above procedure. Assume that the base address of v is in Xo, k is in X1, and temp is in X19. The following swap procedure, written in C, is the basic block of any sorting program. void swap (long long int v[], long long int k) long long int temp; temp = v[k]; v[k] = v[k+1]; v [k+1] = temp; Write the ARM LEGv8 code for the above procedure. Assume that the base address of v is in Xo, k is in X1, and temp is in X19