Given the pseudocode below, show what the list $L$ looks like at the beginning of the while loop at each

iteration for the following inputs.

function $f(L)$

changed $=$ true

$n=1$ angrh $(T)$

while changed

changed $=$ false

for i from $1$ to $n-1$

if $L[i-1]>L[i]$

$x=L[1=1]$

$L[1=1]=L[1]$

T$.[1]=y$

Changed $=$ Lrue

$n=n-1$

resurn L

a$)(5$ pts$)L=[13,4,8,5,1]($Correctness: $2$ pts; Completeness: $2$ pts$)$

b$)(10$ pts$)L=[19,6,7,2,1,4,23]($Correctness: $6pts$; Completeness: $4pts)$