this is my code could you help fix part b of this code please # Part A: Initialize and calculate array A$[]$

addi $$7,$ $$0,366$ # $$7$ init to x $=366$

addi $$8,$ $$0,466$ # $$8$ init to y $=466$

sw $$7,0$x$2020($$$0)$ # a$[0]=$ x

sw $$8,0$x$2024($$$0)$ # a$[1]=$ y

lw $$9,0$x$2020($$$0)$ # load a$[0]$ into $$9$

lw $$10,0$x$2024($$$0)$ # load a$[1]$ into $$10$

li $$11,2$ # initialize loop counter

loop:

sub $$12,$ $$9,$ $$10$ # $$12=$ a$[$i$]-$ a$[$i$+1]$

sub $$12,$ $$12,$ $$10$ # $$12=$ a$[$i$]-2*$a$[$i$+1]$

sll $$13,$ $$11,2$ # $$13=$ $$11*4($byte offset$)$

addi $$13,$ $$13,0$x$2020$ # add base address

sw $$12,0($$$13)$ # store result in memory

move $$9,$ $$10$ # update registers for next iteration

move $$10,$ $$12$

addi $$11,$ $$11,1$ # increment loop counter

bne $$11,16,$ loop # loop until $16$ elements are stored

# Part B: Calculate alphabet$-$count for each element in A$[]$ and store in B$[]$

addi $$14,$ $$0,0$x$2060$ # base address for array B$[]$

li $$11,0$ # loop counter

count$\_$loop:

sll $$13,$ $$11,2$ # calculate offset $($i $*4)$

addi $$13,$ $$13,0$x$2020$ # add base address of A$[]$

lw $$12,0($$$13)$ # load a$[$i$]$ into $$12$

li $$15,0$ # initialize alphabet$-$count to $0$

li $$16,8$ # number of hex digits to check

hex$\_$loop:

andi $$17,$ $$12,0$xf # extract the least significant hex digit

bge $$17,10,$ increment$\_$count # if digit $>=10,$ increment count

j skip$\_$increment # if digit skip increment

increment$\_$count:

addi $$15,$ $$15,1$ # increment alphabet$-$count

skip$\_$increment:

srl $$12,$ $$12,4$ # shift right to process the next hex digit

subi $$16,$ $$16,1$ # decrement hex digit counter

bnez $$16,$ hex$\_$loop # repeat for all hex digits

sll $$13,$ $$11,2$ # calculate offset $($i $*4)$

add $$13,$ $$13,$ $$14$ # add base address of B$[]$

sw $$15,0($$$13)$ # store b$[$i$]$ in memory

addi $$11,$ $$11,1$ # increment loop counter

li $$18,16$ # number of elements in array A$[]$

bne $$11,$ $$18,$ count$\_$loop # loop until all elements are processed

In the image for the data segment in MARS, the addresses $0$x$00002060$ through $0$x$00002080$ shows $1,1,8,1,6,1,7,3,7,2,4,3,5,1,4,2$ but the values are supposed to be B$[0]=0$ B$[1]=0$ B$[2]=1$ B$[3]=0$ B$[4]=0$ B$[5]=1$ B$[6]=2$ B$[7]=2$ B$[8]=1$ B$[9]=1$ B$[10]=1$ B$[11]=1$ B$[12]=1$ B$[13]=3$ B$[14]=4$ B$[15]=4,$ so the values for addresses $0$x$00002060$ through $0$x$00002080$ should be $0,0,0,0,1,2,2,1,1,1,1,3,4,4$ please help fix this Part $($B$)$ alphabet$-$count Array B$[]$: Find the $$alphabet$-$count$$ of each number in array A$[]$ to form a new array B$[],$ and store it at M$[0$x$2060,0$x$2064,...].$ o Definition of $$alphabet$-$count$$ B$($n$)$ of a $32-$bit number n: The number of occurrences of $$A$$ to $$F$$ in the $8-$digit hex representation $($equivalent to the $32-$bit binary representation$)$ of number n: For example, if n $=0$x$01$A$98$FB$7,$ then B$($n$)=3,$ because $$A$,$F$,$B$$ are viewed as $$alphabets$,$ occurring a total of $3$ times.