3. (c) Assume a set $G$ whose elements are real numbers and the size of $G$ is equal to $2^k$, where $k$ is a positive integer. We just want to find the maximum value and the minimum value in this set $G$ and develop an algorithm in the following.

FindMaxMin(G)
  If G contains only two numbers, then compare these two numbers,
  set M to be the larger one, and set m to be the smaller one,
  Else
    Divide G into two subsets with equal size G1 and G2
    Apply FindMaxMin(G1) to get M1 and m1
    Apply FindMaxMin(G2) to get M2 and m2
    M = max(M1, M2), m = min(m1, m2)
  Return M, m

We use $T(N)$ to represent the number of comparisons when the set size is equal to $N$. $N = 2^k$. Please find $T(N)$ in terms of $N$. (10%)