please answer accurately thanks

Incorrect Question 6 0/15 pts Select the best answer. The objective is to prove that when this program ends, 5 = n. Of all potential loop invariants in this question, check the best loop invariant before each iteration to use in order to achieve my objective. S=0 for (i=1; i 0 None of these answers i O US > i for all i>o OsO This property is true, but not very helpful for my objective. S = 1-1 for all i > 0 Incorrect Question 8 0/15 pts Select the best answer. The objective is to prove that when this program ends, m will be the smallest value in Array A. Of all potential loop invariants in this question, check the best loop invariant before each iteration to use in order to achieve my objective. m = A[1] for (i=2; i A[i]) m = A[i] i >=2 i o os 0 The sum of the terms (240+241 +...+24(1-1)) is less than 24.This property is true, but not very helpful for my objective. None of these answers 5 = 2^1 - 1 for all i >= 0 S = 2^{1+1) - 1 for alli > 0