Assume that seme slgerithni requires mere then 23'" hit epsrstiens te eem pute an answer fer s kbit input. Sheer that it is net s pelynemisl time...

I am confused by this question. If I let c^k=2^2√k, then the question is solved. Since c^k/k^ =infinity and c^k>c^k/k^b, so c^k also equals infinity which is not a polynomial time. think this is too easy and not the right way to solve this question.