What does O(n) represent in Big O Notation?*0/1a. Constant time complexityb. Linear time complexityQuadratic time complexity

What does the term 'Big O' represent in the context of time complexity analysis?

What does the Big O notation primarily describe?

Big O Notation

The best-case time complexity of an algorithm is O(1). What does this mean?

Explain the time complexity of the following code snippet in regards of the Big-O notation:1. for (i=0; i<n; i+=4) {2. for (j=1; j<n; j*=2) {3. for (k=0; k<30; k++) {4. print(“Am I still not 30?!!”);5. }6. print(“Why, God, why? We had a Deal!”);7. for (m=n; m>0; m-=2) {8. print(“Could you BE more dramatic?”);9. }10. }11. }