Which of the following is an application of stack?a.finding factorialb.tower of Hanoic.infix to postfixd.all of the above

To determine which option involves an application of stack, we can analyze each choice:

1. Finding Factorial: This typically uses recursion or iterative loops, and while it can be implemented using stack, it is not a direct application of a stack.

2. Tower of Hanoi: This is a classic algorithm that can be effectively solved using a stack. The recursive nature of the problem can be translated into stack operations.

3. Infix to Postfix: This conversion is a common task in compilers and can be efficiently implemented using a stack. It is a direct application of stack data structures.

4. All of the Above: While option A (finding factorial) is not a direct stack application, options B and C are.

Final Answer

The correct answer is c. infix to postfix as it is a direct application of stack, but b. tower of Hanoi is also applicable. Hence the best comprehensive answer is d. all of the above, considering different methods can utilize stack under various circumstances.