Question $3$

Given the insertion sort algorithm below that sorts the elements in non$-$increasing order, find the errors and fill the given table accordingly. Only the answers in the below table will be graded. Note that $N$ is the size of the array.

There are errors in four lines in total, which may be either syntax or logical errors. Fill the below table accordingly.

$\backslash$table$[[$Errors$,$Line Number,Error,Corrected$],[$Error $1,,,],[$Error $2,,,],[$Error $3,,,],[$Error $4,,,]]$