Suppose you have algorithms with the five running times listed be$-$ low. $($Assume these are

the exact running times.$)$ Suppose the current input size is $10.$ How much slower do each of

these algorithms get when you $($a$)$ double the input size, or $($b$)$ increase the input size by one?

$($You can make a table to show the results.