Qu $1$: The following algorithms are for the operations of a Singly Linked List, L$.$ It is assumed that the list has $2$ attributes, head and tail referencing the first and last node respectively. Each node of the list is assumed to have $2$ attributes, info, and next referencing the data item in the node and the next node respectively.

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.