Lies den Code sorgfältig

# Apply the Master Theorem to:
#
#     T(n) = 4·T(n/2) + O(n²)
#
# Extract:
#     a = ?    # number of subproblems
#     b = ?    # shrink factor
#     d = ?    # exponent of the combine cost
#
# Compare a / b^d to 1 and pick the matching case (1, 2, or 3).
#
# What does T(n) resolve to? (form: 'O(n^k)' or 'O(n^k log n)')
# Type your prediction.

Was wird das Programm ausgeben? Schreib hier: