For each of the algorithms, use the provided table to perform a line$-$by$-$line analysis and then answer each of the following questions:

$($i$)$ Find the general running time function, $T(n),$ where n is the number of elements in the list.

$($ii$)$ Explain the worst case scenario $($or explain why there is no best$/$worst case scenario$)$

$($iii$)$ Find the worst$-$case running time. If there is no worst case, find the running time for any of the possible scenarios.

$($iv$)$ Write the running time you find in $($iii$)$ above using $$ notation.

You may assume that the running time of all basic operations is constant.

$]=[5$ Marks

$\backslash$table$[[$a$),//$Adds a node containing the data value, $el,$ at the end of the list, $L.$ Assumes the list is not empty.$],[,\backslash$table$[[Lis{t}_{A}d{d}_T{o}_H$ead$(L,el)$