Given the recursive relation, T(n) = 6T (*) + 3n2 which case of the master theorem would apply in the analysis of the time complexity? (Note, the details of the cases are abbreviated in the choices below, this is due to space constraints, not an attempt to make a trick question.] Case 1: f(n) = O(nlogba-6), T(n) = (nlogba) Case 2: f(n) = (nlogba), T(n) = (nlogbalg(n)) Case 3: f(n) = N(nlogba+t), af(n/b)