i need lap solution please

Exercise 1: (Binary tree traversal) Pseudocode of the classic preorder traversal algorithm for binary trees is given below: Here is pseudocode of the preorder traversal: Algorithm Preorder(T) / /Implements the preorder traversal of a binary tree //Input: Binary tree T (with labeled vertices) / /Output: Node labels listed in preorder if T * 0 print label of T's root Preorder(TL) //TL is the root's left subtree Preorder(TR) //TR is the root's right subtree In this recursive algorithm, find the number of recursive calls made. Exercise 2: (Binary tree traversal) You want to traverse the binary tree in the following order: Right node, center node, and left node. Write the pseudocode for this algorithm using a recursive function. You can give any name of your choice to this function, for example my_order0. Exercise 3: (Big Integer multiplications) Compute 1021*2340 by applying the divide-and-conquer algorithm outlined in the lecture. Assume that you can use your calculator to do only two-digit multiplications. Exercise 4: (Big Integer multiplications) In Exercise 3, you performed three 2-digit multiplications. Assume that you can do only single-digit multiplications (which means that even for 2-digit multiplications, you need to use the divide and conquer algorithm). How many single-digit multiplications will be required in total to solve the problem in Exercise 3