Consider an algorithm with a computational complexity of $O(n^{{?}^{{?}^{?}}}2)$ for a problem of size $n.$ If the problem size increases by a factor of $k,$ what is the new computational complexity?

$O(k^2{n}^2)$

$O(n)$

$O(kn)$

$O(n^2)$