QUESTION $7$

Matrix multiplication has a time complexity of

a$.O(n)$

b$.O(n^2)$

c$.O(n^3)$

d$.O(n^4)$

QUESTION $8$

The theoretically fastest sorting algorithm has a time complexity of

a$.n^{2\mathrm{.}807}$

b$.log{2}^n$

c$.nlogn$

d$.n^2$

QUESTION $9$

Bubble sort and selection sort have a time complexity of

a$.O(n)$

b$.O(n^2)$

c$.O(n^3)$

d$.$ d$.O(nlogn)$