Please don't take handwriting picture. Please type the answer.

Please don't take handwriting picture. Please type the answer.

Please don't take handwriting picture. Please type the answer.

Please don't take handwriting picture. Please type the answer.

Please don't take handwriting picture. Please type the answer.Please don't take handwriting picture. Please type the answer.Please don't take handwriting picture. Please type the answer.

Please don't take handwriting picture. Please type the answer.

Please don't take handwriting picture. Please type the answer.

Please don't take handwriting picture. Please type the answer.

Please don't take handwriting picture. Please type the answer.

Please don't take handwriting picture. Please type the answer.

Please don't take handwriting picture. Please type the answer.

Please don't take handwriting picture. Please type the answer.

Please don't take handwriting picture. Please type the answer.

Please don't take handwriting picture. Please type the answer.

Please don't take handwriting picture. Please type the answer.

ALGORITHM Propose a data structure that supports the stack operations PUSH, POP, and a third operation FIND MIN which returns the smallest element in the stack (does not delete the element). All three operations should run in O(1) worst case time. Write algorithms for the three operations Provide an example (with actual numbers) to show how each algorithm works