ll jj null figure decoding an invalid morse code sequence (define morse code tree adt morse code tree is decision tree that contains the letters of the alphabet and other special symbols in its nodes the nodes are organized based on the morse code sequence corresponding to each letter and symbol morsecodetree()builds the morse code tree consisting of the letters of the alphabet and other special symbols translatecodeseq )translates and returns the given morse code sequence to its equivalent character if the sequence is valid or returns none otherwise we leave the implementation of the adt as an exercise the tree has to be built as part of the constructor start with an empty root node and then add one letter at time when adding letterfollow the branches corresponding to the code sequence representing the given letter if null child link is encounteredsimply add new empty node and continue following the branches after reaching the end of the sequencethe letter being added to the tree is assigned to the last node visited exercises given binary tree of size what is the minimum number of levels it can containwhat is the maximum number of levels draw all possible binary trees that contain nodes