1) Assume the following code

F(int A[], int n, int item)

int pos=(sqrt(n)+n*n)%n

A[pos]=item

The time complexity for this code is

Select one:

a.O(1)

b.O(n²)

c.O(n)

d.O(sqrt(n))

------------------

2) After generating the AVL tree from the list: 7, 10, 15, 25, 22, 13, 11, 5, 9, 3, 6, 1

The root is

a)15

b)10

c)13

d)7

----------------------------

3) Connected graph has a path that cotains every node in the graph

Select one:

a)False

b)True