Note: ###Sir Need a *UNIQUE* solution for this problem, please don't copy paste from other sources. I will upvote. Thanks! (python or java)####

Trees and Graphs (For the below tasks, you may want to create a binary tree manually and use the same tree for all of these tasks. However, for task 6, you need two trees; hence, prepare another) NB: All the methods(1-7) as well as the main method/tester statements must be written in one class. DO NOT write a different class for each method. Compile all your codes and simulation picture in ONE PDF and submit it. 5. Print elements of all the Nodes of a tree using Post-order Traversal. 6. Write a method which will evaluate whether two trees are exactly same or not. 7. Write a method which will return a copy (new tree) of a given tree. 8. An adjacency matrix is given below: A B C D E F G A 0 A 0 1 0 1 1 0 0 o o o o o o 1 1 C 0 1 0 0 0 0 0 D 0 0 1 0 0 0 1 E o o o o o o 0 F 0 0 0 1 0 0 0 G0 0 0 0 1 1 0 0 10 0 0 0 0 0 0 a) Draw the equivalent graph