# Problem 1 1. T(n) = 9T(n/3) + n + n 2 + 1 2. T(n) = 2T(2n/9) + &...

## Transcribed Text

Problem 1 1. T(n) = 9T(n/3) + n + n 2 + 1 2. T(n) = 2T(2n/9) + √ n 3. T(n) = 2T(n/11) + p√ n 4. T(n) = T(n − 2) + O(1) 5. T(n) = 2T(n 1/4 ) + 1 6. T(n) = 2T(n) + n 2 Problem 2 You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Problem 3 Given n, how many structurally unique binary search trees (BST’s) can you construct that store values 1 . . . n? For example, given n = 3, there are a total of 5 unique BST’s: Figure 1: All the unique BST’s given n = 3

## Solution Preview

These solutions may offer step-by-step problem-solving explanations or good writing examples that include modern styles of formatting and construction of bibliographies out of text citations and references. Students may use these solutions for personal skill-building and practice. Unethical use is strictly forbidden.

By purchasing this solution you'll be able to access the following files:
Solution.docx.

# 50% discount

Hours
Minutes
Seconds
\$35.00 \$17.50
for this solution

or FREE if you
register a new account!

PayPal, G Pay, ApplePay, Amazon Pay, and all major credit cards accepted.

### Find A Tutor

View available Data Structures and Algorithms Tutors

Get College Homework Help.

Are you sure you don't want to upload any files?

Fast tutor response requires as much info as possible.