Write, and test using spim and MIPS, an assembly language program that inputs two character strings from the user, each with at most 20 characters, and then outputs the number of unique characters that are found in both strings (dont count the newline character or the zero terminator). For example, with the input strings monday morning and coffee spills, your program should output 3 (for the blank character, o, and i). (Note: an efficient solution is not required, your program can use any algorithm that works.)

Please comment the code and explain what is happening.