9 What is a basic operation? 10 What is the worst case complexity function of an algorithm? 11 One algorithm needs 100n basic operations to process an input of size n, and another algorithm needs 25n basic operations to process the same input. Which of the two algorithms is more efficient? 12 What does it mean to say that fin) is not in Olg(n))? 13 What does it mean to say that f(n) is in O(g(n)