[15 marks] Imagine a computer with no cache, but with a reasonable-size register file. The computer has a single floating-point multiplier.

7. [15 marks] Imagine a computer with no cache, but with a reasonable-sizeregister file. The computer has a single floating-point multiplier. Theeffect of these assumptions is that each floating-point multiply (operation)will, with probability 1, find one of its two operands in the register file,but will need its other operand delivered from memory, and this for _each_floating-point multiply. Let the floating-point multiplier have a peakperformance of 16 GFs/s. At present, the achievable bandwidth from thememory to the processor is 7 GWs/s. (Here, 'W' stands for _word_, not Watt,and, by assumption, one word can hold one floating-point value). K = 10^3a) [5 marks] Describe this situation as _compute bound_ or _bandwidthbound_.situation = ______________b) [5 marks] We buy a second DRAM module and more interconnection links withthe same aggregate capacities as the first. Describe this new situation as_compute bound_ or _bandwidth bound_.situation = ______________c) What would it take to achieve sustained performance equal to the peakperformance?answer = ______________