Read and Analyze Pseudocode: Consider the following algorithm $($In the algorithm, A$[0..$n$-1]$

refers to an array of n elements i$.$e$.$ A$[0],$ A$[1]...$ A$[$n$-1])$Classified$($A$[0..$n$-1])$: minval $=$ A$[0]$

maxval $=$ A$[0]$

for i $=1$ to n$-1$:

if A$[$i$]<$ minval:

minval $=$ A$[$i$]$

if A$[$i$]>$ maxval

maxval $=$ A$[$i$]$

return maxval $$ minval