I need help with the following question on data structures and algorithms: Prove that the algorithm given below is corre

[answerhappygod]

I need help with the following question on data structures and
algorithms:
Prove that the algorithm given below is correct using the loop
invariant theorem. Also, justify the choice of loop invariant.
The algorithm is as follows:
(1) initialize j = 0.
(2) While j ≤ m, do:
i. Increment j.
ii. If j divides m, output j.