$3.$ The following iterative algorithm find the minimum element of an array A$[$a$..$b$]$ of positive integers. We assume the array is never empty $($n $!=0)$

Precondition: A$[$a$..$b$]$ is a non$-$empty array of positive integers

Postcondition: min is the least element in A$[$a$..$b$]$

min $=$ A$[$a$]$

i $=$ a$+1$

while $($i $<=$ b$)$

$\{$

if A$[$i$]<$ min

min $=$ A$[$i$]$

i$++$

$\}$

$($a$)$ What is the break condition $?$

$($b$)$ What is the Loop Invariant