B$.$ Consider this graph, represented with an adjacency list:

$(1)$ Draw this graph in the above box $($arrange the vertices in a circle in clockwise order A $-$ E$).$

$(2)$ Sketch the adjacency$-$matrix representation of this graph below:

$(3)$ Which properties$*$ does the above graph have? Circle all that apply.

Directed

Undirected

Acyclic

Tree

Complete

A is a source

B is a source

$E$ is a sink

Properties of graphs:

An undirected graph has edges that are unordered pairs $($edges are drawn without arrows$).$

A directed graph has edges that are ordered pairs $($edges are drawn with arrows$).$

An acyclic graph has no cycles

A tree is a connected undirected graph with no cycles

A complete graph has edges between all pairs of vertices

A source is a vertex with no incoming edges

A sink is a vertex with no outgoing edges