Let m be a segment of data memory starting at location 5100 and ending at the first locations (after 5100) that contains 0.

Write a MIPSzy program that computes: the sum of positive numbers in m (stored in data memory location 5084)

the number of positive values in m (stored in data memory location 5088)

the sum of negative numbers in m (stored in data memory location 5092); and

the number of negative values in m (stored in data memory location 5096)

include comments

Com Sci/Com Organization

For example, if m contains: 5100 10 5104 12 51085 5112 -6 5116 11 51201 5124 0 After execution of the program, data memory will contain 5084 34 5088 4 509211 50962 5100 10 510412 51085 5112-6 5116 11 51201 51240 For example, if m contains: 5100 10 5104 12 51085 5112 -6 5116 11 51201 5124 0 After execution of the program, data memory will contain 5084 34 5088 4 509211 50962 5100 10 510412 51085 5112-6 5116 11 51201 51240