Please do it correctly!!!!!!

(10. 15pts) Computational problem solving: Proving Correctness Complete the proof by loop invariant method to show that the following algorithm is correct Algorithm Convert(n: positive integer) output: b (an array of bits corresponding to the binary representation of n) begin t=n k=0 while (t > 0) k=k+1 b [k] = t mod 2 t = t div 2 (div refers to integer division) end Use the following loop invariant: If m is the integer represented by the binary array b[1. then n = Initialization: Maintenance: Termination (10. 15pts) Computational problem solving: Proving Correctness Complete the proof by loop invariant method to show that the following algorithm is correct Algorithm Convert(n: positive integer) output: b (an array of bits corresponding to the binary representation of n) begin t=n k=0 while (t > 0) k=k+1 b [k] = t mod 2 t = t div 2 (div refers to integer division) end Use the following loop invariant: If m is the integer represented by the binary array b[1. then n = Initialization: Maintenance: Termination