Consider running BFS on vertex a in the following graph. Depending on what order children are chosen in, you may discover vertices in different orders, and you might get different trees. Assuming that BFS is run using a FIFO Queue, note which of the following are possible. a bc de a 11 b1 11 c1 1 1 d 11 1 Discover in order abcde, bc are children of a, d is a child of b, e is a child of e. Discover in order acbde, bc are children of a, de are children of b. Discover in order acbde, bc are children of a, de are children of c Discover in order abcde, bc are children of a, de are children of c Discover in order abcde, bc are children of a, de are children of b Discover in order abcde, bc are children of a, d is a child of b, e is a child of c