Design a recursive linked list of InsertionSort using the algorithm designed below: procedure InsertionSort ( L(0:n-1), size) size = 1 then InsertionSort (L, size) current

Design a recursive linked list of InsertionSort using the algorithm designed below:

procedure InsertionSort ( L(0:n-1), size)

size <----- size -1

if size >= 1 then

InsertionSort (L, size)

current <---- L[size]

position <----- size-1

while position >=0 && current < L[position] do

position <------ position - 1

end while

L [position + 1] = current

end if

end