int $\mathrm{M}=0 \times 12 \mathrm{FF) 5699$ int $\mathrm{N}=0 \times 00000 \mathrm{FFF} ; $ int $\mathrm{K)=0 ;$ int $\mathrm{L)=0 ; $ void maino $\left\{\begin{array}{1}\mathrm{K}=\mathrm{M} \& \& \mathrm{-N) ; // \text { Bitwise AND} \mathrm{M}=\mathrm{K} \mathrm{N} // \text { Bitwise OR } \mathrm{L}=\mathrm{M}+31 ; \end{array} ight. $ printf("The value of Lis: $\% \mathrm{-d}", \mathrm{-L})$ Translate the following High Level C program into a complete to MIPS Assembly: (2 marks) CS.JG.16