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)

(make sure code is commented clearly)