Problem 1: Floyd-Hoare Verification (6 points) The following…
Problem 1: Floyd-Hoare Verification (6 points) The following program computes the power of an integer base \(b\) to a non-negative exponent \(n\) (i.e., calculates \(b^n\)). Prove the program’s partial correctness (that if it halts, \(r = b^n\)), by giving a Floyd-style proof. Please fill in the valid inductive invariants at the underlined spaces provided in the code below. Problem 2: Termination (4 points) Consider the following program: Prove that the above code terminates always by giving a proof based on ranking functions. You only need to provide the ranking function \(V(x, y)\). Hint: You may consider a linear combination of variables. Congratulations, you are almost done with this quiz. DO NOT end the Honorlock session until you have submitted your work to Gradescope. When you have answered all questions: Use your smartphone to scan your answer sheet and save the scan as a PDF. Make sure your scan is clear and legible. Submit your PDF to Gradescope as follows: Email your PDF to yourself or save it to the cloud (Google Drive, etc.). Click this link to go to Gradescope to submit your work: Quiz 13 Return to this window and click the button below to agree to the honor statement. Click Submit Quiz to end the exam. End the Honorlock session.