Write in MIPS Mars Assembly

Write in MIPS Mars Assembly. There is a robot starting at position (0,0), the origin, on a 2D plane. Given a sequence of its moves, judge if this robot ends up at (0,0) after it completes its moves. The move sequence is represented by a string, and the character moves[i] represents its i th move. Valid moves are R (right), L (left), U (up), and D (down). If the robot returns to the origin after it finishes all of its moves, return true. Otherwise, return false. Note: Assume that the magnitude of the robot's movement is the same for each move Sample test case 1: Input: moves = "UD" Output: true Explanation: The robot moves up once, and then down once. So it ended up at the origin where it started. Therefore, we return true. Sample test case 2: Input: moves = "LL" Output: false Explanation: The robot moves left twice. It ends up two "moves" to the left of the origin. We return false because it is not at the origin at the end of its moves. Sample test case 3: Input: moves = "RRDD" Output: false Example 4: Input: moves = "LDRRLRUULR" Output: false