Write a MIPS Mars program that from the starter code below, that computes the lowest common multiple of two integer numbers. Integer number m is stored in $a0, and integer number n is stored in $a1. $a2 stores the temporary LCM by increamenting m, initially starts out as m. $a3 stores the temporary LCM by increamenting n, intitially starts out as n. The return should be in the $v0 register. Please utilize the starter code, and COMMENT so I can try to understand the code.

Call: Icm_recursive(m,n,m.n); int Icm_recursive (int m, int n, int Icm_m, Icm_n) if (1cm, m == 1cm-n) return 1cm-m; if (1cm-m > 1cm-n) lcm-n = lcm-n + n; else 1cm-m = lcm-m + m; return (Icm_recursive(m,n, Icm_m, lcm_n); Assemble and execute LCM_Recursive.asm This should create following sample output Enter a +ve number: 4 Enter another +ve number 6 LCM of 4 and 6 is 12 Call: Icm_recursive(m,n,m.n); int Icm_recursive (int m, int n, int Icm_m, Icm_n) if (1cm, m == 1cm-n) return 1cm-m; if (1cm-m > 1cm-n) lcm-n = lcm-n + n; else 1cm-m = lcm-m + m; return (Icm_recursive(m,n, Icm_m, lcm_n); Assemble and execute LCM_Recursive.asm This should create following sample output Enter a +ve number: 4 Enter another +ve number 6 LCM of 4 and 6 is 12