Determine the complexities of the following recursive functions, where c > 0 is the cost of basic operations in the functions. (You may assume that n = 2k for some k).

Consider the recursive function, use the Big O notation to determine its complexity without using Masters Theorem

T(n) = 2T(n/2) + c n if n > 1;

T(1) = 0, if n = 1