Show your answers in detail and with clear explanations, please.

I do give thumbs up.

Thank you in advance!

The solution has to be in machine language programming for simple machine.

Given an array of N integers, count the number of zero elements. There are two possible algorithms for this problem provided on hills in the assignment2 directory. They are in countzeroes.c and countzeroesdec.c. They differ in whether the loop is traversed normally or by decrementing the counter. Your solution should, of course, work for any size array of (positive or negative) numbers.This means if I modify your array to add or delete items I should not have to change your code. If I change the value of N (the number of items in the array) and the array items it should work correctly. You may use temporary variables to implement this program Submit a copy of your program as a plain text file on canvas. The name of the program must be countzeroes (note: there is no extension!)