Suppose a recurrence for an algorithm has the following form:

$.$ If c $=3$ and we know that the amount of work at every level is the same, then a and b might be $\_?\_$ and the complexity of the algorithm is $\_?\_$

Group of answer choices

a $=3$ b $=27,\backslash$Theta $($n$4)$

a $=2$ b $=6,\backslash$Theta $($n$3)$

a $=2$ b $=8,\backslash$Theta $($n$3$lgn$)$

a $=1$ b $=3,\backslash$Theta $($nlnn