Define one (1) original* recurrence relation, solve it using the method of backward substitution. The recurrent relation must follow the pattern below. f(n)=Af(ChangeInN)[Cnp]D Where: - Af( ChangeIn N) is required. - A>0 - ChangelnN =>nqn/2, - where q>0 - [Cnp] is optional - C>0 - p>0 - D is required - D>0 * Original means unique in this discussion. Two recurrence relations are considered distinct if one term is added or removed; or if at least a term is different