Note : c and e must be solved very precisely with comments

1 Given the figure below which represents six cities (A,B,C,D,E, and F) and the roads connection them with the figures beside them denoting the distance in kilometres d) What data structure will you use to represent the above? 1 b) What is the implementation issue that you will face when implementing the data structure? How will you solve it? 2+2=4 c) Impiement the data structure in C++. d) How can you find the shortest distance between any given 2 cities? e) Implement a method to find the shortest distance in C++