First check the file stackType.h $($attached to this assignment$),$ which contains both the declarations and

definitions of the member functions for the Stack class. Write the functions to do the following:

$1.$ Write a non$-$member function, named multiplyStackItemsBy$2,$ that multiplies every

element in an integer stack by $2.$ Do not use recursion. The function has the prototype of

void multiplyStackItemsBy$2($stackType &S$)$;

Example: If the stack S contains the items

$[2,-1,3,4,5,3,0]$

Where $2$ is the top of the stack, and you call the function as in

multiplyStackItemsBy$2($S$)$;

The stack content will then become

$[4,-2,6,8,10,6,0]$

$2.$ Re$-$implement the non$-$member function in the previous question using recursion. Call the function

multiplyStackItemsBy$2$Rec.

$3.$ Write a recursive non$-$member function, named findMinAndMaxStack, that simultaneously

finds the minimum and maximum values in a given integer stack.

For example, if the stack S contains the items

$[2,-1,3,4,5,3,0]$

The function should return $-1$ as the minimum and $5$ as the maximum values. Assume that the

prototype of the function is as follows:

void findMinAndMaxStack$($stackType &S$,$ int &minval, int &maxval$)$;

So$,$ minimum, and maximum values must be returned through the reference formal parameters of

minval and maxval. If the stack S originally is empty, do nothing and just return from the

function.