Nt) Select all true statements.
A. You can prove a statement P(n) for all natural numbers n by showing P(1), P(2) and P(n)→P(n+1) for all natural numbers n.
B. The Fibonacci sequence fn is big-Omega of (3/2)n.

Many newspapers carry a certain puzzle in which the reader must unscramble letters to form words. how many ways can the letters of emdangl be arranged? identify the correct unscrambling, then determine the probability of getting that result by randomly selecting one arrangement of the given letters.