The table of participation for a tracks competition is in →Table 2.10. Suppose matches A to F represent a data element, respectively. If two matches cannot be held simultaneously, then they are...

The table of participation for a tracks competition is in →Table 2.10. Suppose matches A to F represent a data element, respectively. If two matches cannot be held simultaneously, then they are connected (restraining condition). (1) According to this table and the restraining condition, draw the corresponding graph structure model, and draw the adjacency list structure of this graph. (2) Write the element sequence obtained by BFS starting from element A.