I want to know question number 8.

I would be grateful if you could help me with the details. I am really confused about this assignment. And please don't copy other answers to here.

8. if subset construction was used to convert the following NFA into a DFA, with dead state G, with all transitions defined, and with no state that is inaccessible from the start state A. Circle the following transitions that might appear in the DFA? Note: {X}C{W} is used to denote the transition on input c from state x to state w. {A,B,D,E}2{F} {B,F}2{G}