Consider the following method for the questions in this section: (f) Returna the maximum value in the tree rooted in roote If or b if the tires is enpty (f rreoonditiont root retera to a binaxy searah trem If which contalini poaltive integerg private Int findmax (Treeliode reot) it (reot = holl) retarn oi elat \& minting code ? True or false? The following code segment can replace missing code * if (root.getRight ()== nuli) return root.getvalue (); else return findMax (root. getRight ()) ; True False True or falne? The following code segment can replace missing code * while (root.getright () != nul1) root = root. getRight ( ) return root. getValue (); True False True or false? The following code segment can replace