a) Create a graph using the cities as vertices and the edges as interstates, use only the cities listed below. Indude an edge if the two cities are connected by an interstate. Use the table of the interstate distances between cities (in miles) to do the following ROCK Rockford ROCH Rochelle CHI Chicago Joliet JOL CHA Champaign-Urbana Effingham EFF MTV Mount Vernon ESTL East St. Louis SPR Springfield UN Lincoln BN Bloomington-Normal PEO Peoria QC Quad Cities Peru PERU RCK RCH CHI JOL CHA EFF MTV ESTL SPR LIN BN PEO QC PERU RCK 32 88 RCH 32 81 88 48 CHI 88 81 45 JOL 45 107 91 61 CHA 107 83 92 56 EFF 83 69 98 MTV 69 75 ESTL 98 75 93 SPR 92 93 38 LIN 38 45 45 BN 91 56 45 45 64 PEO 45 45 QC 88 93 80 PERU 48 61 64 80 b) Design a trip, starting in Peoria, that will visit Chicago, Champaign-Urbana, and Rockford you want to plan a stop at two historic sites along your route and you will end up in Effingham. Draw your graph ) Find the path that will minimize your distance; use Djkstra's Algorithm here c) Design a trip starting and ending in Peona, that will visit the cities of East St Louis Peru Springfield and Joliet you also are planning a stop at two historic sites along the way 93

a) Write a program that asks user to enter number of vertices in a directed graph and then the adjacency matrix representing the directed graph. The program, then, must display the node with the highest outdegree. Assume that nodes are named as 0, 1, 2 and so on. You will find a sample run of the program below. Enter number of vertices: 4 Enter adjacency matrix: 0 1 1 1 0 0 0 0 0 0 0 0 0 1 1 0 Node with the highest outdegree: 0

Java

Write a code that can be used to plot a 3D graph where x & y are between -5 to 5 and z is defined by the following equation. “z=4x4y - 3x3y2 + x”

] ] is_bipartite In the cell below, you are to write a function "is_bipartite (graph)" that takes in a graph as its input, and then determines whether or not the graph is bipartite. In other words, it returns True if it is, and False if it is not. After compiling the above cell, you should be able to compile the following cell and obtain the desired outputs. print (is_bipartite({"A" : ["B", "C"], "B" : ["A"], "C" : ["A"]}), is_bipartite({"A" : ["B", "C"], "B" : ["A", "C"], "C" : ["A", "B"]})) This should return True False Python Python

Python code polygon, draw any polygon using Turtlesim in ROS2 Foxy – Python! Given the number of sides (n) and length of sides (l), one can easily draw anypolygon shape.

MipMaps I Suppose that a pixel projects to an area of 10x28 texels in a texture map. From what mipmap level does the texture unit look up the texture value for this pixel, if the texture unit is using "nearest" lookup for mipmaps? Enter a single integer that is the mipmap level. A/

FAST

Please follow the instructions in the screenshots provided and use that to implement the code given below. Done in python 3.10 or later please.    class WeightedAdjacencyMatrix :    """A weighted graph represented as a matrix."""     __slots__ = ['_W']     def __init__(self, size, edges=[], weights=[]) :        """Initializes a weighted adjacency matrix for a graph with size nodes.         Graph is initialized with size nodes and a specified set of        edges and edge weights.                Keyword arguments:        size -- Number of nodes of the graph.        edges -- a list of ordered pairs (2-tuples) indicating the                 edges of the graph.  The default value is an empty list                 which means no edges by default.        weights -- a list of weights for the edges, which should be the same                   length as the edges list.  The position of a value in                   the weights list corresponds to the edge in the same                   position of…