The graph:[V , E} where V={A,B,C,D,E,F,G,H,I},E={(A,B),(A,D),(A,E),(B,E),(D,G),(E,F),(E,H),(G,H),(F,C),(F,H),(H,I),(C,B),(I,F)}
Task 3: Write Java code that creates the breadth-first tree and depth-first tree. The operation is performed as an add-on to Tasks
1&2. Traverse both trees in some order so that the tree traversal has the same sequence as the graph traversal.