this is all one question

Problem 2 : Mutton Offended Our Neighbors (40pts) 2.1 (9) Neatly dw all buy tres containing at most five (5) nodes with shapes that satisfy the AVL tre property 2.2 (8) Nestly dle all fait binary trees with ef most three (3) levels that wantify the AVL ttre property. You do not need to include keys 2.3 Dervention erexpression for Amin, the minimum wicht of the AVI. trol free to draw a picture to illustrate your swer. For full credit, the final form of your will contain tosiombol 2. Suppose that you have contestructed an AVL tree and a BST from a set of us. Which washed you get to be byber-the AVL tree of the EST Justify your not for full credit 2.5 Once in conder at of the represented by a BST and an AVL tree. Suppone that an de travel Led Process Root, Right of the AVL tree outputs the keys in the same des an order trawal of the UST. What if thing, can yonder about the relationship between the EST AVL treet Are they the same shape Are they will Your sade will be the station of your where Problem 2 : Mutton Offended Our Neighbors (40pts) 2.1 (9) Neatly draw all limary tres containing of wiost five (1) Dodes with shapes that satisfy the AVI. tre property 2.2 (8) Neatly duwe will full binary troes with at most three (3) levels that matkaty the AVI. treo property. You do not to include by 2.3 Derive an equation or expression for men, the minimum best of an be AVI. tr. Feel free to draw a picture to illustrate your own. For full credit, the final form of your answer 2.4 Suppose that you have constructed an AVL true and a BST from a given tof keys. Which would you expect to be higher the AVI. tree of the ISTJutify your answer for full credit 2.5 Once again, consider a set of keys represented by a BST and an AVL tre. Suppose that an in-oder traversal (Le Process Root, Richt) of the AVL tree output the keys in the me order in order traversal of the IST. What, if anything can you infet about the relationship between the BST AVL tre Are they the same slape? Are the entical? Your grade will be based on the justification of your answer Problem 2 : Mutton Offended Our Neighbors (40pts) 2.1 (9) Neatly dw all buy tres containing at most five (5) nodes with shapes that satisfy the AVL tre property 2.2 (8) Nestly dle all fait binary trees with ef most three (3) levels that wantify the AVL ttre property. You do not need to include keys 2.3 Dervention erexpression for Amin, the minimum wicht of the AVI. trol free to draw a picture to illustrate your swer. For full credit, the final form of your will contain tosiombol 2. Suppose that you have contestructed an AVL tree and a BST from a set of us. Which washed you get to be byber-the AVL tree of the EST Justify your not for full credit 2.5 Once in conder at of the represented by a BST and an AVL tree. Suppone that an de travel Led Process Root, Right of the AVL tree outputs the keys in the same des an order trawal of the UST. What if thing, can yonder about the relationship between the EST AVL treet Are they the same shape Are they will Your sade will be the station of your where Problem 2 : Mutton Offended Our Neighbors (40pts) 2.1 (9) Neatly draw all limary tres containing of wiost five (1) Dodes with shapes that satisfy the AVI. tre property 2.2 (8) Neatly duwe will full binary troes with at most three (3) levels that matkaty the AVI. treo property. You do not to include by 2.3 Derive an equation or expression for men, the minimum best of an be AVI. tr. Feel free to draw a picture to illustrate your own. For full credit, the final form of your answer 2.4 Suppose that you have constructed an AVL true and a BST from a given tof keys. Which would you expect to be higher the AVI. tree of the ISTJutify your answer for full credit 2.5 Once again, consider a set of keys represented by a BST and an AVL tre. Suppose that an in-oder traversal (Le Process Root, Richt) of the AVL tree output the keys in the me order in order traversal of the IST. What, if anything can you infet about the relationship between the BST AVL tre Are they the same slape? Are the entical? Your grade will be based on the justification of your