单选题：The following psuedo-code is for solving the Profix Sums problem

The following psuedo-code is for solving the Profix Sums problem parallely, where the input $$N$$ numbers are stored in the array `A`. Which of the following gives the time and work load of the algorithm? @[C](3)
```
for Pi , 1 <= i <= n pardo
B(0, i) := A(i)
for h = 1 to log(n)
for i, 1 <= i<= n/(2^h) pardo
B(h, i) := B(h-1, 2*i-1) + B(h-1, 2*i)
for h = log(n) to 0
for i even, 1 <= i<= n/(2^h) pardo
C(h, i) := C(h+1, i/2)
for i = 1 pardo
C(h, 1) := B(h, 1)
for i odd, 3 <= i <= n/(2^h) pardo
C(h, i) := C(h+1, (i-1)/2) + B(h, i)
for Pi , 1 <= i<= n pardo
Output C(0, i)
```
A. $$T(n) = O ( log n ), W(n) = O( n log n )$$
B. $$T(n) = O ( n ), W(n) = O( n )$$
C. $$T(n) = O ( log n ), W(n) = O( n )$$
D. $$T(n) = O ( n ), W(n) = O( n log n )$$




A.$$T(n) = O ( log n ), W(n) = O( n log n )$$
B.$$T(n) = O ( n ), W(n) = O( n )$$
C.$$T(n) = O ( log n ), W(n) = O( n )$$
D.$$T(n) = O ( n ), W(n) = O( n log n )$$


答案：C