In this question two rooted trees are considered to be isomorphic if they are isomorphic as directed graphs. For example, the rooted trees TA and TB shown on the right are isomorphic because an isomorphism fof TA to TB is given by f(1) =5, f(2)=7, f(3) = 6,4) = 8. Rooted trees that are not isomorphic are said to be nonisomorphic. (a) 6 T4 8 TB Draw two nonisomorphic rooted trees such that each rooted tree has exactly 3 vertices. Reminder: The rooted trees must not be isomorphic. (b) | Draw three rooted trees T, T', and T" such that each of T, T', and T" has exactly 4 vertices and no two of T, T', T", and T are isomorphic. (c) Draw five nonisomorphic rooted trees such that each tree has exactly 5 vertices and the root of each tree has at least two children. Make sure that no two of your rooted trees are isomorphic as digraphs, and that each of your five trees has exactly 5 vertices!