print(get_right_child(get_right_child( ))self check given the following statementsx binary_tree(' 'insert_left( ,' 'insert_right( ,' 'insert_right(get_right_child( )' 'insert_left(get_right_child(get_right_child( ))' 'which of the answers is the correct representation of the tree [' '[' '[][]][' '[][' '[][]]] [' '[' '[][' '[' '[][]][]]][' '[][]] [' '[' '[][]][' '[][' '[' '[][]][]]] [' '[' '[][' '[' '[][]][]]][' '[][]]write function build_tree that returns tree using the list of lists functions that looks like thisnodes and references our second method to represent tree uses nodes and references in this case we will define class that has attributes for the root valueas well as the left and right subtrees since this representation more closely follows the object-oriented programming paradigmwe will continue to use this representation for the remainder of the using nodes and referenceswe might think of the tree as being structured like the one shown in we will start out with simple class definition for the nodes and references approach as shown below the important thing to remember about this representation is that the attributes left and right will become references to other instances of the binarytree class for examplewhen we insert new left child into the tree we create another instance of binarytree and trees and tree algorithms