Suppose you have algorithms with the six running times listed below. $($Assume these

are the exact number of operations performed as a function of the input size n$.)$ Sup$-$

pose you have a computer that can perform $1010$ operations per second, and you need

to compute a result in at most an hour of computation. For each of the algorithms,

what is the largest input size n for which you would be able to get the result within

an hour?$(1)$ n$2,(2)$ n$3,(3)100$n$2,(4)$ n log n$,(5)2$n$,(6)22$n$.$