solve the following recursions with big-o (prove o and ω bounds) notation, using the guess and verify or brute-force expansion, but not the master theorem. for simplicity, you can assume that t(n)