NOTE: for each question, write exact answer $($do NOT write approximate answer or in terms of big$-$O$).$

Refer to the following pseudocode algorithms to give precise answers to the questions in the provided screenshot:

$1.$ Insertion Sort:

for j$=2$ to A$.$length

key$=$A$[$j$]$

i$=$j$-1$

while$($i$>0$ and A$[$i$]>$key$)$

A$[$i$+1]=$A$[$i$]$

i$=$i$-1$

A$[$i$+1]=$key

$2.$Original Bubble Sort:

for i$=1$ to A$.$length$-1$

for j$=$A$.$length down to i$+1$

if$($A$[$j$]$ A$[$j$-1])$

Exchange A$[$j$]$ with A$[$j$-1]$

$3.$ Modified Bubble Sort:

for i$=1$ to A$.$length$-1$

boolean swap $=$ false

for j$=$A$.$length down to i$+1$

if$($A$[$j$]$ A$[$j$-1])$

Exchange A$[$j$]$ with A$[$j$-1]$

swap$=$ true

if$($swap $==$ false$)$

break

$4.$ Merge Sort:

MERGE$-$SORT$($A$,$ p$,$ r$)$

if$($p