7. Give a concise formula that gives the approximate number of digits in a positive integer. The integer is written in base 10 8. Why is the order of an algorithm generally more important than the speed of the processor? 9. Convert each time formula to the best possible big-O notation. Do not include any spurious constants in your big-O answer Time FormulaBig-o 10n 2n2 3 times log (base 2) ofn 2n2 10n