Problems 299 flops implement a state machine as shown in the diagram below.Construct a e lookup table and two D the machine. Ae hat describes the machine, p-lops j ROM contents Location Value ROM RD A2 (1 CLK- y) 1 1 1 0 0 0 108 GB/s ute the effective access time for this program m nmultiply, and divide are performed on with eight words per block. The size of main 16 and B in Figure 7-13 in which each of the four operations on value for with eight words per block. The size of main memory is . Show the address and the 216 words and the cache is initially empty d from the cache it t0 htm.) each case. 5r Design an eight-word, 32-hit RA Problems 299 flops implement a state machine as shown in the diagram below.Construct a e lookup table and two D the machine. Ae hat describes the machine, p-lops j ROM contents Location Value ROM RD A2 (1 CLK- y) 1 1 1 0 0 0 108 GB/s ute the effective access time for this program m nmultiply, and divide are performed on with eight words per block. The size of main 16 and B in Figure 7-13 in which each of the four operations on value for with eight words per block. The size of main memory is . Show the address and the 216 words and the cache is initially empty d from the cache it t0 htm.) each case. 5r Design an eight-word, 32-hit RA