Use the following table to help answer the question.

$\backslash$table$[[$TABLE $1$ Graph Terminology.,Multiple Edges Allowed?,Lops Allowed?$],[$Type$,$Edges,No$,$No$],[$Simple graph,Undirected,Yes,No$],[$Multigraph$,$Undirected,Yes,Yes$],[$Pseudograph$,$Undirected,No$,$No$],[$Simple directed graph,Directed,Yes,Yes$],[$Directed multigraph,Directed,Yes,Yes$],[$Mixed graph,Directed and undirected,,$]]$

Draw graph models, stating the type of graph $($from Table $1)$ used, to represent airline routes where every day there are four flights from Boston to Newark, two flights from Newark to Boston, three flights from Newark to Miami, two flights from Miami to Newark, one flight from Newark to Detroit, two flights from Detroit to Newark, three flights from Newark to Washington, two flights from Washington to Newark, and one flight from Washington to Miami, with

$($d$)$ an edge from a vertes representing a city where a flight starts to the vertex representing the city where it ends.

$($c$)$ an edge for each flight from a vertex representing a city where the flight begins to the vertex representing the city where the flight ends.

of $14$

Section $10\mathrm{.}6$: $3,26$

Use the following table to help answer the question.

$\backslash$table$[[$Npe$,$Eitsu,Molible Edgen Allowedf,Leopi Allowedt?$],[\backslash$table$[[$Simple graph$],[$Mutioranth$]],\backslash$table$[[$Uefincted$],[$indimetat$]],No,$No$],[$Muthigaph$,$Iindiretad,Yes,No$],[$Menklepaph$,$indimoted,Ye$,$Yev