1. Import the java project BinaryTrees to your IDE(Eclipse) and create a new class called TreeTraversal.java 2. Create the binary tree tree2 (treel already exists in the template) treel tree2 Write a function called checkSkipped that takes a tree as an argument traverses it in an Inorder traversal and prints out the traversed nodes. The function should return true if there is a skipped alpha character in the sequence and false if the tree contains a perfect sequence of alphabets. 3. For example: Input: tree1 Output: False Explanation: The inorder traversal is ABCDEFGHI and there is no skiped character Input: tree2 Output: True Explanation: The inorder traversal is BDEFGHXY and there are many skiped characters. Between B and D there is no C and there are many missing characters between H and x. public class TreeTraversal [ public static void main(String[] args)( // Create a tree called tree1 BinaryTreeCharacter tree! = new BinaryTree("H"); BinaryTreeCharacter rightsubtreel rightsubtree1.attachRight('Y"); new Bina ryTree("X". BinaryTree tree){ /* / To Iterate a tree using Inorder Traversal Treelterator