Two computers have 8-stage fetch-execute cycles where branches are determined in stage 4. One computer is not pipelined, and the other is pipelined. Assuming that tp = 1, answer the following...

Extracted text: Two computers have 8-stage fetch-execute cycles where branches are determined in stage 4. One computer is not pipelined, and the other is pipelined. Assuming that tp = 1, answer the following questions when running a program with 50,000 instructions where 4,000 of the instructions are conditional branches and each branch, if taken, skips over 5 instructions. a. How much faster is the pipelined machine over the non-pipelined machine assuming that no branches are taken. b. How much faster is the pipelined machine over the non-pipelined machine assuming that all branches are taken?