Operator precedence parser falls under the category of top-down parsers. This is false because it comes under the category of the Bottom up Parsers.
To evaluate a postfix expression, an operator stack is required; this is also false, Only operand stack is required, no other data structure.
It is not necessary to have automatic garbage collection to implement recursion. This is true.
Garbage Collection $(GC)$ is a mechanism that provides automatic memory reclamation for unused memory blocks.
option $C$