Question 1 Simulate GSelect below. At each time T below, index into the GSelect table at T using the PC and GHR at T and write the prediction (T or N). Then write the new GHR and new GSelect state at timestamp T+1 given the actual branch outcome. We provide the initial predictor state at Time 0. The GHR is two bits, with the rightmost bit being the newest. The PC hash is PC[2] (e.g., the hash of 0x0004 is 1). Time 1: PC-0x3018, Act.-T Time 0: PC 0x300C, Act.-N GHR 00 01 10 11 0 10 10 10 10 PC[2] 1 10 10 10 10 GHR 00 01 10 11 0 PC[2] 1 1t Time 2: PC 0x300C, Act.-N 0 PC[2] 1 GHR 00 01 10 10 11 Pred: GHR: 01 Pred: GHR: Prod: GHR: Time 3: PC-0x3018, Act.-N Time 1: PC-0x300C, Act.-N GHR GHR 00 01 10 11 00 01 10 11 Time 5: PC 0x3018, Act.-T GHR 00 01 10 11 0 PC[2] 1 0 PC[2] 1 0 PC|2] 1 Pred: GHR: Time 6: PC-0x300C, Act.-N => PC[2] 0 GHR 00 01 10 11 Pred: GHR: Time 7: PC-0x3018, Act.-N GHR PC|2| 00 01 10 11 Pred: GHR: Time 8: PC-0x300C, Act.-N GHR 00 01 10 11 0 PC[2] Prod: GHR: Pred: GHR: Pred: GHR: Time 9: PC-0x3018, Act.-T Time 10: PC=0x300C, Act.-N Time 11: PC 0x3018, Act.N GHR GHR GHR 00 01 10 11 00 01 10 11 00 01 10 11 0 0 PC[2] PC[2] 1 1 0 PC[2] 1 Pred: GHR: Time 11: PC 0x3018, Act.N GHR 00 01 10 11 Prod: GHR: Pred: GHR: Time 9: PC 0x3018, Act.-T Time 10: PC-0x300C, Act.N GHR GHR 00 01 10 11 00 01 10 11 0 1t PC[2] 1 PC|2] 1 0 PC[2] 1 Pred: GHR: Pred: GHR: Pred: GIR: 3