For the following function, identify the loop invariant, the loop exit condition, and the loop post-condition which shows the algorithm's correctness. You can simply list the assertions, or you can copy and paste the function into the answer field and add assertion annotations as comments, as shown in the lecture. def minlist(1st): Input: A non-empty list 1st of integers Output: The minimum value in lst For example: >>> minlist([3,6,2,5,4]) 2 while len(1st) > 1: a = lst.pop() b = lst.pop() if a