Let us consider an expression tree $($see example below$)$arked out of$00$Flag questionSelect one or more:O a$.$ Leaf nodes can be operators b$.$ If the expression tree includes operators then the root node cannot be an operand $($a value$)$O c$.$ A non leaf node can be an operator or an operand $($a value$)$ d$.$ Printing the expression tree, in any of the $3$ notations, is O$($N$)$ where N is the numberof nodesDe. Printing the expression in prefix form can include brackets