Q:

Write a method in Mips (assembly) ways that finds the number of anagrams of an input string

example

Input:

n = 8

k = 4

s = dei

L = { abc, ide, ldc, bae, ccb, acb,ddb ,cca }

Output: 1

there is an anagram of dei in L: ide.

The algorithm should work as follows:

1. implements a mergesort to sort each string in L and store the sorted strings in the heap,

2. sorts the string s

3. checks how many sorted strings are identical to the sorted string s

4.please write the code comment if could.

5. a number that represents n 6. a number that represents k 7. the string s 8. the strings in L