Fill in a proof outline (repairing the program, if necessary) that shows that this program finds the location k of the first positive element (a[k]>0) in an array a[1:N] and returns N+1 if there is none such.