Write a function in assembly language that implements the selection sort algorithm shown below. Use the swap and strlen functions you wrote in the previous steps. Remember, all functions must follow the standard conventions of preserving selected registers onto the stack.

Write a main function that calls your selection$\_$sort function several times with various null$-$terminated strings pre$-$loaded in memory. Your main function should print the original string to the console before you call the selection sort function and then print the sorted string to the console after you call the function.

void selection$\_$sort$($ char $*$message $)$

$\{$

int length $=$ strlen$($ message $)$;

for$($ int i $=0$; i $<$ length; i$++)$

$\{$

int index$\_$of$\_$min $=$ i;

for$($ int j$=$i; j $<$ length; j$++)$

$\{$

if$($ message$[$index$\_$of$\_$min$]>$ message$[$j$])$

$\{$

index$\_$of$\_$min $=$ j;

$\}$

$\}$

swap$($ message, i$,$ index$\_$of$\_$min $)$;

$\}$

$\}$

Can this be done in MIPS assemby? These are my swap and strlen functions if you can implement them

swap:

# Load char at index$1$: char temp $=$ message$[$index$1]$

add $t$0,$ $a$0,$ $a$1$

lbu $t$1,0($$t$0)$

# Load char at index$2$ and store at index$1$: message$[$index$1]=$ message$[$index$2]$

add $t$2,$ $a$0,$ $a$2$

lbu $t$3,0($$t$2)$

sb $t$3,0($$t$0)$

# Store temp char at index$2$: message$[$index$2]=$ temp

sb $t$1,0($$t$2)$

jr $ra

strlen:

# Initialize counter i to $0.$

li $t$0,0$

loop:

# Load character at message$[$i$]$

add $t$1,$ $a$0,$ $t$0$

lbu $t$2,0($$t$1)$

# Check if character is null terminator.

beq $t$2,$ $zero, end

# Increment counter i$.$

addi $t$0,$ $t$0,1$

j loop

end:

# Set return value.

move $v$0,$ $t$0$

jr $ra