You are analyzing a transportation network graph that represents road connections between cities. To simplify your analysis and reduce computation time, you decide to apply an elementary graph operation. Which operation would you use, and why?a)Deletion, to remove unnecessary cities and roads from the graph.b)Enumeration, to list all road connections for statistical analysis.c)Contraction, to merge closely connected cities into one for simplification.d)Addition, to create new road connections between cities to improve navigatio

Required informationSkip to questionNOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part.What kind of graph from the following table can be used to model a highway system between major cities, where  there is an edge between the vertices representing cities for each interstate highway between them and there is a loop at the vertex representing a city if there is an interstate highway that circles this city?Multiple ChoicePseudographMultigraphSimple graphMixed graph

Which of the following ways can be used to represent a graph?

Consider all scenarios in which we have a city on a flat plane in which all roads are straight lines; the points at which two (or more) roads meet are called junctions; and we have two points A and B that are accessible from each other by road.In this question you have to determine whether the following statement is true or false.Among all possible routes between A and B, the shortest route goes through the fewest number of junctions.The following points may be helpful:Consider using a pen and paper to draw a few maps when thinking about this problem.The statement is about all possible scenarios, not just a particular city map that you may happen to draw. The statement is about all maps imaginable (with the above-mentioned properties). Obviously you cannot draw all possible maps, so you need to reason about this problem.The statement is true if you can convince yourself that it holds in all possible maps for all possible pairs of locations A and B. The statement is false if you can draw a map in which the statement does not hold.You can assume all distances are finite.Is the statement true or false?

You are a new data scientist. You have been tasked with coming up with a solution for reducing traffic congestion and improving transportation efficiency. How would you go about it?1 pointGather and analyze streetcar operations data and identify congested routesSuggest creating more parking lots and garages in the citySuggest implementation of surge charges for ride-sharing services.Suggest implementation of strict speed limits and traffic fines

Describe the economic and political factors involved in building a network of roads, canals, and railroads.