W(n) represents the running time of a recursive algorithm. If we always had 'a' processors available to use, and we had to compute the span of the same algorithm, how could a function, compute_span, be written to compute the empirical span, where the work of the algorithm is given by W(n)? Explain using C code, please!