Consider the following algorithm, modList $($front$)$ that manipulates a given singly$-$linked list, where

front is a reference to the first node of the list and each node stores an integer value. For each one of

the questions $($a$)$ and $($b$),$ you need to

$($I$)$ first, indicate whether the algorithm would either $($i$)$ terminate without crashing, $($ii$)$ crash, or

$($iii$)$ get caught in an infinite loop. If the code would crash, explain which exception would be

thrown

$($II$)$ second, show what the resulting linked list would look like when the algorithm is executed. You

must show ALL the nodes and the variables p$,$ q$,$ and head$1$ for $($a$)$ and p$,$ q$,$ and head$2$ for $($b$)$

$($if the algorithm would get caught in an infinite loop, show what the linked list would look like

after $3$ iterations of the loop$).$