Test your programs by running them on MARS.

Write and test a MIPS assembly language program to determine the longest common prefix $($LCP$)$ between two given strings.

The program should compare two strings character by character and return the longest common prefix. If no common prefix exists, return an empty string. You can consider the strings as predefined inputs in the data section.

Example:

Given the strings:

String $1$: "abcdef"

String $2$: "abcxyz"

The longest common prefix is: "abc".

Once tested, submit your $.$asm file after running it using the MARS Simulator.