Suppose that each procedure of a PAR segment (see Figure 12.14) requires 1 unit of time to execute. A program consists of three sequential segments. Each segment requires k time units and must be executed on a single processor. The three sequential segments are separated by two PAR segments, each of which consists of k procedures that can be executed on independent processors. Derive an expression for speedup for this program when it is run on a multiprocessor with n processors. Assume nk. What is the limiting value of the speedup when k is large and n = k? What does this result tell you about the effect of sequential segments in programs that have some segments with substantial parallelism?