Write a recursive method, toparenthesisNotation, that returns a string representation of a tree in a string using parenthesis to represent the different levels of a binary tree. A binary tree can be represented using parenthesis as follows (root LT RT) where LT and RT are the corresponding left subtree and right subtree expressed in the same representation. For example, the tree below has as parenthesized representation of (A) (B C D) Write a routine that does a recursive traversal of a tree and returns a parenthesized representation of a node. You can assume that the tree is full, that is every node has 0 or 2 children. Note that a node with zero children is represented by the node name itself, and a node with children, then it is represented as (name LT RT) where LT and RT are obtained through recursive calls. Your feedback will appear here when you check your answer.Previous question