1) If algorithm is expressed using the following equation, write the complexity usuing "Big Oh" notation? f(x)=33n^2+98n+18.54

2)In a single linked list queue with a head pointer only,what is the cost of enque operation() answer in Big Oh notation as it relates to input size

3)Assume the most efficient implementation of a single linked list stack, what is the cost of pop operation() answer in Big Oh notation as it relates to input size

4) Explain how the size of the array affect the likelihood of collision when using the division method in a hash table.

5)Create a max heap out of the following values.Draw a heap state each intersection and swap point.

values- 20,40,30,10,90,70

6)Binary Search Tree explains how the data structure determines where to place a new node (Short response coding)