explain why the dynamic

$-$

set operation INSERT $on$ a $singly$ linked list can $be$ implemented $inO$

$($

$1$

$)$

$time,$ but the worst

$-$

case time for DELETE $is$

$($

$n$

$)$

$.$