3. (12 points total) Assume you have an initially empty Stack and a string of N characters. A program performs N push operations of each of those characters in the order in which they appear in the string. After each push, it performs any number of pop operations, such that the total number of pops is N. Assume that the pop operation prints the value that came off. For example, you could have the string:

LEMONS

Then you perform the following sequence of pushes and pops

push(L), push(E), push(M), pop(), pop(), pop(), push(O), pop(), push(N), pop(), push(S), pop()

It would result in the following output string:

MELONS

Now, consider the string:

RESCUED

For following two output strings, provide the sequence of stack operations that would generate it from the initial string of RESCUED. If the sequence cannot occur, explain why. a. SECURED b. REDUCES