Prove that the Merge() function of your own merge sort algorithm in the question 2 is correct using "induction on loop invariants" by following the guidelines below : (10 points)

3.1 Write down general description of loop invariant technique in your own words as proof of correctness. (2 points)

3.2 Identify the loop invariant of the loop in your merge() function (3 points)

3.3 Describe initialization step (0 points)

3.4 Describe maintenance step (4 points)

3.5 Describe Termination step (1 point)

Deliverable:

-Your answers in a simple text file format