Fine Grained multithreading.

The following shows two threads, Thread A and Thread B, to be run on superscalar machine with 2 slots. Assume that before the code is run a, b, x and y are 0. Show how each would execute on Fine-Grained Multithreading. What are values of a, b, x and y at the end of Fine MT completion? A1: x = y + 5 A2: a = b + 7 A3: y = x*a A4: a = x + y A5: x + = 5 A6: a = y + 7 A7: b = y + b B1: a = y + 3 B2: x = a + y B3: x = b + 7 B4: y = a + 7