Q$2.18$ marks : Graphs

A travel agent uses a graph to arrange trips to his customers. A graph is constructed to define the connections between a number of cities $($vertices$)$ in the Arab Gulf region. The cities are: Abu Dhabi $($AD$),$ Mascot $($Mt$),$ Kuwait $($K$),$ Manama $($Mn$),$ Reyadh $($R$).$ Sanaa $($S$)$ and Doha $($D$).$ The connected roads $($edges$)$ are such that:

$($AD$,$Mt$),($Mt$,$AD$),($AD$,$R$),($R$,$AD$),($D$,$R$),($R$,$D$),($Mt$,$R$),($R$,$Mt$),($S$,$D$),($D$,$S$),(Mn,Mt),(Mt,Mn),(Mt,K),(K,Mt),(K,S),(K,D).$

A$.[4$ marks$]$ Show how the above graph can be stored by constructing the:

$[2$ marks$]$ adjacency list.