<h3>Question Description</h3> <p>Instructions for Final Portfolio</p><p>For your final portfolio, you will compile your representative writing from our class. This portfolio can be organized in any way you wish, provided that
<p>The following is a preorder traversal of a binary tree:</p><p>PREORDER: 9,5,3,1,4,8,6,20,12,10,11,30,21,31</p><p>a)Draw the Binary Search Tree T.</p><p>b)Based on TRANSPLANT(T,5,8),draw the left subtree of theroot(you do not need to draw the whole