Determine if the graph is a complete simple graph. If it is not a complete simple graph, explain why. d K2

Kansas City The graph models the baseball schedule for a week. The vertices represent the teams. Each game played is represented as an edge between two teams. How many games are scheduled for Kansas City during the week? List the teams that they are playing. How many times are they playing each of these teams? Nashville Arlington Seattle Detroit Toronto How many games are scheduled for Kansas City during the week? The number of games scheduled for Kansas City is 6. (Type a whole number.) List the teams that Kansas City is playing. Select all that apply. YA. Detroit O B. Arlington Seattle C. YD. Nashville E. Toronto O F. No teams How many times is Kansas City playing each of these teams this week? Kansas City is playing Nashville time(s), Arlington time(s), Detroit time(s), Seattle time(s), and Toronto time(s). (Type whole numbers.)

100% 75%- Percent 50%- 25%- 0%- AL League NL What is the name for this kind of graph? Home Win no yes

Q12C. Assess whether the statement is true or false: The graph shown is not a tree. True False a e b