For each of the following applications, indicate which of these data structures would be most suitable and give a brief justification for your choice. For data structures like trees and graphs, describe what information is stored in the vertices and edges, and, if the edges are weighted, describe what information is stored in the weights. Describe the most appropriate data structure from the list, with details about vertices and edges where appropriate. 1. Map of the Jamaica road system used to display traffic travel times on a web page. The map displays principal towns, intersections, and major landmarks, the roads that connect them, and the travel times between them along those roads. Travel times along the same road may be different in different directions. 2. Chess board - an 88 board used for a game of chess. Each square on the board is either empty or contains a chess piece. 3. The history list recording sites visited by the user of a web browser. As new sites are visited they are added to the list. The list also supports the operation of going back to the web page that was previously visited before the current page and going forward to the next page visited. 4. A computer model showing the dependencies between the steps needed to assemble a car at one of Tesla's California plants. 5. A list of the legal words in a Scrabble@(8 M game. We want to be able to quickly check whether words used by players do, in fact, exist in the list. 6. Description of the inheritance relationships between classes in a C++ program