Using the assembly language MIPS please help implement this. The shell to use fo this assignment is below.

# Student Name:

# Date:

# This program computes the similarity count for the two arrays Patch1

# and Patch2 and stores it at the memory location labeled Similarity.

# The similarity count is the number of times each pair of corresponding

# pixels in the two arrays is within an epsilon (5) of each other.

.data

# DO NOT change the following three labels (you may change the initial values):

Patch1: .word 1, 14, 9, 10, 11, 6, 56, 60, 78, 100, 4, 5, 0, 3, 5, 9

Patch2: .word 1, 18, 7, 16, 12, 1, 68, 49, 70, 826, 2, 9, 9, 9, 9, 9

Similarity: .alloc 1

.text

# write your code here...

jr $31 # return to OS

The shell program has two integer arrays declared and initialized as the global variables Patchl and Patch2. Each array contains 16 unsigned integers, representing a set of pixel values in a region of an image. Your program will compute the following measure of how similar the two regions are: compare each pair of corresponding pixels (i.e., for each index i, compare Patch! [i] to Patch2 [i]) and count the number of times they are within an epsilon = 5 of each other (i.e., their difference is less than 5). Your program should print out the similarity count (Similarity) using the print statement in the shell code. Be sure to try multiple test cases, but do not change the declaration of the global variables (you should change only their initial values, such as the pixel values in the two arrays to create new test cases). ECE 2035 Homework 1 Fall 2017 Example Patch![] = Patch! [ ] = Similarity {1, 14, 9, 10, 11, 6, 56, 60, 78, 100, {1, 18, 7, 16, 12, 1, 68, 49, 70, 826, = 1+1+1+0+1+0+0+0+0+0+1+1+0+0+1+1-8 9} 9} 4, 5, 0, 3, 5, 2, 9, 9, 9, 9