Consider the expression T | F ∧ T. In how many ways can the expression be parenthesized so that the output is F (false)?
(a) 0
(b) 1
(c) 2
(d) 3
This question was posed to me during an interview.
My doubt stems from Counting Boolean Parenthesizations in portion Dynamic Programming of Data Structures & Algorithms II