128289 Computer Science

Q1. True or False? O(n) is called linear time 02. True or False? O(n*n) is called quadratic time 03. True or False? An algorithm that has complexity O(log n) is always faster than one that has O(n) complexity. 04. What is the output of the below code: int main() int arrl5] 1,2,34,5) cout