You must use the skeleton code in the response and the code from the first picture $($conv$).$ You're going to create a function that performs $2$D convolution by calling that original function, using many of the same assumptions $($a fixed $3$x$3$ filter, with a stride of $1$ and no padding$).$ This time you$$re going to need to write the output array on the stack and print the entire array within the function. Your $2$D convolution function will accept $4$ parameters, input height, input width, a pointer to the start of the input array and a pointer to the filter array. You can assume the input and output matrices will be no larger than $25$ by $25.$

There$$s a lot of iteration variables that you$$ll need to keep track of across calls to the original conv function. This is a great time to use the $s registers, but in order to ensure correctness you need to make sure to save and restore those registers in the conv function using the stack. Also, we expect the conv$2$D function to properly handle the $s registers, so your function will be tested in a way that ensures those registers are unaffected.

$//$The a registers match the order of the arguments

$//$$a$0->$ inp$\_$height, $a$1->$ inp$\_$width, $a$2->$ inp, $a$3->$ filt

void conv$2$D$($int inp$\_$height, int inp$\_$width, int inp$[],$ int filt$[])\{$