consider the following algorithm. it's complete

in algorithm. PRE: A is an array 1..n of integer elements. POST: hello returns when the smallest n elements are in increasing order starting at index = 1

The smallest i elements are in increasing order starting at index = 1 i = 0

for pass = 1; pass pass; |-- if (AU) condition (2) Show how AND

POST in algorithm. PRE: A is an array 1..n of integer elements. POST: hello returns when the smallest n elements are in increasing order starting at index = 1

The smallest i elements are in increasing order starting at index = 1 i = 0

for pass = 1; pass pass; |-- if (AU) condition (2) Show how AND

POST

<><>