Write an algorithm for a method named Delete Prime Numbers From Stack which takes the stack of integers values as input and removes all the prime values that a stack contains. No need to write...

Extracted text: Write an algorithm for a method named Delete Prime Numbers From Stack which takes the stack of integers values as input and removes all the prime values that a stack contains. No need to write whole/extra code of push, pop functions. You have to write only the above method procedure. Note: Make sure that there is no change of order in the remaining stack values after removing the prime values from it. If we have a Stack S of integer values like 23 18 8 21 After calling the above mentioned method the remaining values which are in the stack like 18 8 21 3. 2.