104  Pascal User Manual  Produces as results (assuming aplmpriate input):  begin  Min  := A[l];  Max:= Mi  I;  Item:= 2;  while Item < MaxSize de  begin  First  := A[Item];  SE'()nd:= A[Item+1];  if First > Second thE  begin  if First> Max  ther  ~dX  := First;  if Second < Min  th~'  Min  .- Second  end else begin  if Second> Max  the: Max  .- Second;  if First < Min  the~  Min  := First  end;  Item .= Item + 2  end;  if Item = MaxSize then  if A[MaxSize]  > Max  t  len Max  := A[MaxSize]  else  if A[MaxSize]  <  Min  ~hen  Min  := A[MaxSize];  Writeln(Output,  Max,  lin);  Writeln(Output)  end {MinMax};  begin  for Item := 1 to MaxSize  Read (Input,  A[Itemj);  end;  Writeln(Output);  MinMax;  (0  begin  :rite(Output, A[Itemj  :4)  for Item := 1 to MaxSize  10  begin  Read(Input,  Increment);  A[Item]  := A[Itemj  +  ~n  rement;  Write (Output,  A[Itemj  end;  Writeln(Output);  MinMax  end .  -1  -3  4  7  8  54  2  .~  3  9  9  9  -6  45  79  79  3  1  1  5  79  -6  44  40  7  15  9  88  1  4  7  43  12  17  -7  48  59  39  9  7  7  12  88  -7 