How would I write the insertion sort algorithm to work with the rest of the code instead of the sort function on this piece of javascript. var list $=[]$;

var sortedList $=[]$;

function populateList$()\{$

list $=[]$;

for $($let i $=0$; i $<20$; i$++)\{$

list.push$($randomString$())$;

$\}$

displayList$($list$,$ 'listSection'$)$;

$\}$

function randomString$()\{$

return Math.random$().$toString$(36).$substring$(2,10)$;

$\}$

function displayList$($arr$,$ elementId$)\{$

document.getElementById$($elementId$).$textContent $=$ arr.join$(\text{'},\text{'})$;

$\}$

function sortList$()\{$

sortedList $=[...$list$]$;

sortedList.sort$()$;

displayList$($sortedList$,$ 'sortedListSection'$)$;

$\}$

$//$ Insertion Sort implementation

function insertionSort$($inputArr$)\{$

var n $=$ inputArr.length;

for $($let i $=1$; i $<$ n; i$++)\{$

$//$ Choosing the first element in our unsorted subarray

var current $=$ inputArr$[$i$]$;

$//$ The last element of our sorted subarray

var j $=$ i $-1$;

while $($j $>=0$ && current $<$ inputArr$[$j$])\{$

inputArr$[$j $+1]=$ inputArr$[$j$]$;

j$--$;

$\}$

inputArr$[$j $+1]=$ current;

$\}$

return inputArr;

$\}$

function insertValue$()\{$

var value $=$ document.getElementById$(\text{'}$insertValue$\text{'}).$value;

if $($value$.$trim$()===\text{'}\text{'})\{$

alert$(\text{'}$Please enter a value.$\text{'})$;

return;

$\}$

sortedList.push$($value$)$;

sortedList.sort$()$;

displayList$($sortedList$,$ 'sortedListSection'$)$;

$\}$

function randomizeList$()\{$

populateList$()$;

document.getElementById$(\text{'}$sortedListSection$\text{'}).$textContent $=\text{'}\text{'}$;

$\}$

populateList$()$;