1.a. [30pts] Convert the following recursive Greatest-Common-Factor function into MIPS assembly language gcf a, b r a % b; # r is the Remainder of a / b (see rem) if ( r-0 ) return b; else return gcf( b, r)