two ordered trees and 'are said to be isomorphic if one of the following holdsboth and 'are empty both and 'consist of single node both and 'have the same number > of subtreesand the ith subtree of is isomorphic to the ith subtree of ''for , design an algorithm that tests whether two given ordered trees are isomorphic what is the running time of your algorithmc- extend the concept of an euler tour to an ordered tree that is not necessarily binary tree - we can define binary tree representation for an ordered general tree as follows (see figure )for each node of tthere is an internal node of associated with if is an external node of and does not have sibling immediately following itthen the children of in are external nodes if is an internal node of and is the first child of in tthen is the left child of in if node has sibling immediately following itthen is the right child of in given such representation of general ordered tree tanswer each of the following questionsa is preorder traversal of equivalent to preorder traversal of tb is postorder traversal of equivalent to postorder traversal of tc is an inorder traversal of equivalent to one of the standard traversals of tif sowhich one