data structures and algorithms

1. What is the Big Oh of the following computations? product = 1; n = 100; for (int counter = 1; counters n; counter - counter +1) product - product counter; 1 print product; } Answer: 2. What is the Big Oh of the following computations? for j = 1 ton for x = 1 ton sum - sum + 1; ) print sum; 1 Answer: 3. What is the Big Oh of the following computations? Sumo for j=1 to n sum=sum +1: for x = 1 to n sumsum +1:1 print sum: Answer: 4. How many nodes are in a full binary tree of height 152 Answer: 5. What is the height of a complete binary tree that contains 160 nodes? Answer: 6. Given the numbers 74 56 34 9 71 92 80 1 44 51 101 insert each data element in its proper node and draw the binary search tree