Write the $C$ routine count $N$ as defined below that returns the number of times $n$ occurs

in stack s$.$ The stack before and after a call to count $N$ must be equivalent $($i$.$e$.$ it must

contain the same values in the same order$).$ You must use the stack ADT as defined

on the back.

int countN$($stack s$,$int $n)$;

Can someone help me find the correct answer for this question.