Absolutely devastatingly hard. O-Notation Remember that n!≥Ω(kn). Trees Binary trees are on the program. Count calls of f()