7. You have 5 algorithms, Al took O(n) steps, A2 took n log n) steps, and A3 took 2(n) steps, A4 took O(ny) steps, A5 took on?) steps. You had been given the exact running time of each algorithm, but unfortunately you lost the record. In your messy desk you found the following formulas: (e) 7n! (f) 23 logan (g) 22 log2 n For each algorithm write down all the possible formulas that could be associated with it