Researchers at MIT's Schwarzman College of Computing are studying algorithmic complexity in quantum computing. A function with one parameter n performs an operation with theta(n^2) (read: big theta n squared) time complexity and then makes two recursive calls to itself, each with parameters of n/2, unless n is less than 1, at which point it stops. What is the overall big theta time complexity of the function?