The Giving Tree of Errors 3.0 You are given a binary tree written as a sequence of parent child pairs. You need to detect any errors which prevent the sequence from being a proper binary tree and print the highest priority error. If you detect no errors, print out the lexicographically smallest 5-expression for the tree. Input Format Input is read from standard input and has the following characteristics:
• It is one line.
• Leading or trailing whitespace is not allowed. Each pair is formatted as an open parenthesis 'l', followed by the parent, followed by a comma, followed by the child, followed by a closing parenthesis')'. Example: (A,B)
• All values are single uppercase letters.
• Parent-Child pairs are separated by a single space.
• The sequence of pairs is not ordered in any specific way.

Input (A,B) (B,C) (A,E) (BD