Listen

Q$3(20$ points$)$: Linked$-$List

Write complete pseudocode for a methode $($call it Process$\_$List$)$ that takes a linked$-$list of student grades. The method prints the maximum and minimum grades in the list as shown below. The list can be empty. Handle all cases. The method specification is:

METHOD Process$\_$List $($L: Pointer$\_$Type$)$;

Assume this sample list: $90,89,76,54,100,63,88,95,36,12,86$

$79,88$

Method Output:

Maximum grade: $100$

Minimum arade: $12$

Listen

Q$3(20$ points$)$: Linked$-$List

Write complete pseudocode for a methode $($call it Process$\_$List$)$ that takes a linked$-$list of student grades. The method prints the maximum and minimum grades in the list as shown below. The list can be empty. Handle all cases. The method specification is:

METHOD Process$\_$List $($L: Pointer$\_$Type$)$;

Assume this sample list: $90,89,76,54,100,63,88,95,36,12,86$

$79,88$

Method Output:

Maximum grade: $100$

Minimum arade: $12$