please do the following

• Describe your loop invariant
• Initialization - show that the loop invariant holds before the first iteration of the loop
• Maintenance - show that the loop invariant holds at each beginning of the loop, after the loop was executed
• Termination - show that the loop invariant holds when the loop terminates and provides a correct end result

# Nonrecursive Fibonacci def F(n): a-0 b1 i1 while i