Rewrite the insertionSort$()$ so that it takes one additional Boolean input to determine sort in ascending order or descending order

public void insertionSort$($Comparable$[]$ list$)$

$\{$

for $($int index $=1$; index $<$ list.length; index$++)$

$\{$

Comparable key $=$ list$[$index$]$;

int position $=$ index;

$//$ Shift larger values to the right

while $($position $>0$ && key.compareTo$(($T$)$list$[$position$-1])<0)$

$\{$

list$[$position$]=$ list$[$position $-1]$;

position$--$;

$\}$

list$[$position$]=$ key;

$\}$

$\}$