Given below is a recursive function fib for computing the nth fibonacci number. Draw the recursive tree for computing fib(4) def fib(n):     if n <= 1:         return 1     else:         return fib(n - 1) + fib(n - 2)

Please sho step by steps and draw the tree

Python Using recursion only No loops If the list is empty or does not contain any sets, the function should return 0. Using type() function and must be return not print def countSets(lst):

Please draw a recursion tree also! And don't copy paste. 1. Write the recursive algorithm taught in class to find the longest common subsequence. For the following generate a recursion tree. b a 500 g b 10 g h

Create a binary linked tree, and traverse the tree by using the recursive function. The structure of the tree is as follows: //check pic//  You should input the nodes in pre-order sequence. If a child of a node is NULL, input a space. Write the function of create binary tree, pre-order to print the nodes, in-order to print the nodes and post-order to print the nodes. Count the height of the tree.   Hints: Header file typedef char ElemType;   typedef struct node//define the type of binary tree node {                                       }BTnode;       Source file #include <stdio.h> #include <stdlib.h> #include "tree.h"   BTnode * createTree()//create the binary tree，return the root {             BTnode *tnode;// tnode is the root             char elem;                                ;//input the character                            //if the input is a space，set the pointer as NULL               Else// if the input is not a space，generate the binary node and create its left…

Recursion Trees Use the recursion tree method to determine the asymptotic upper bound of T(n). T(n) satisfies the recurrence T(n) = 2T(n-1) + n, and T(0)=0.

Recursion tree metho T(n)= T(n/5)+T(7n/10)+n

Using the recursion tree method find the upper and lower bounds for the following recurrence (if they are the same, find the tight bound). T (n) = T (n/2) + 2T (n/3) + n.

Implement the pre-order tree traversal algorithm in C++. This program should use the following binary tree (see image) and display the pre-order tree traversal of the nodes’ values. Feel free to write this iteratively or recursively. Also, explain how it works and how a new tree could be provided to the code. PS: make sure that the logic of the program is correct, meaning that it can work well with different binary trees. I would like to change the tree input to the pre-order traversal function. The program should work errorless and display the result correctly. No need to code it to read the user input, however, provide instructions on how a new tree can be defined in this program to check if the program works fine with different trees.

Q2 please show your work