Paragraph

$\sqrt[\phantom{2}]{x}$

$(40pts)$ The following tasks deal with the Array$-$based and Linked List$-$based implementations of the Unordered List $($AUList and LLUList$).$ For full credit, you must add the requisite functions to the existing classes provided with the assignment with matching function signatures. In addition, remember that we will be using a driver program to test your code for sample inputs$/$outputs$,$ so you can expect a heavy penalty if the class and header files $($AUList$.$h$,$ AUList.cpp$,$ LLUList.h$,$ LLUList.cpp$)$ you submit do not compile and function.

a$.($Easy$)$ Write function "int getMin$()"$ for both AUList and LLUList that computes and returns the smallest element in the list.

Ex: if an AUList mXAL has elements $(3,2,1,4,5,6),$ then mxAL.getMin$()$ should return $1.$

b$.($Medium$)$ Write a function "int getRange$()"$ for both AUList and LLUList that computes and returns the difference between the smallest and largest element in the list.

Ex: if an LLUList myLL has elements $(3,2,1,4,5,6),$ then myLL$.$getRange$()$ should return $5.$

c$.($Challenging$)$ Write a function "DuplicateSE$($int first, int last$)"$ for the AUList that duplicates only those elements of the list beginning with first and ending with last $($both inclusive$)$ The member function must have the signature AUList DuplicateSE$($int first, int last$).$

Ex: If a AUList myAL has elements $(5,1,3,9,7,11)$ then myAL.DuplicateSE $(1,4)$ should return an AUList with elements $(1,3,9,7)-$ in that order. Note that you do not need to write a version of this for the LLUList structure. Note that calling DuplicateSE should not modify the structure of the original AUList $($myAL in the above example$).$

Submissions are to use Gradescope. Be sure to refer to the Blackboard Assignments page, as well as Gradescope walk$-$through from the week of $\frac{1}{22}-\frac{1}{26}$ for submission details and help.