A stake machine pushes operands on a stack and evaluates binary operators by a pcs (i.e pop/compute/store) where the top two operands are popped computation is performed and the result is pushed onto stack. Evaluation of an expression (x* y) + (u* ν) by Reverse Polish notation in a stack machine needs
(a) 4 push and 3 pcs instructions (b) 6 push and 1 pcs instructions (c) 4 push and 1 pcs instructions (d) 5 push and 2 pcs instructions
(a) 4 push and 3 pcs instructions (b) 6 push and 1 pcs instructions (c) 4 push and 1 pcs instructions (d) 5 push and 2 pcs instructions