Gurobi/Python help

In this problem, you need to use Gurobi to solve a large scale network flow problem in a network with 100 vertices. undirected 1. Use "import random" at the beginning of your python script to load the random package used to generate random numbers 2. Set "random.seed(1)" in your code so that we can generate same pseudo random numbers. 3. Generate a list of 100 random integer numbers with range from 0 to 100 as x-coordinator, 4. Generate another list of 100 random integer numbers with range from 0 to 100 as y-coordinator, 5. Each of your vertex i 0,...,99 has x-coordinate al1 and y-coordinate yli]. The dis- you can name it as . you can name it as z. tance between any two vertices should be the Euclidean distance between them (d(i,j) - Solve the problem for the shortest path problem from vertex 0 to vertex 99. In this problem, you need to use Gurobi to solve a large scale network flow problem in a network with 100 vertices. undirected 1. Use "import random" at the beginning of your python script to load the random package used to generate random numbers 2. Set "random.seed(1)" in your code so that we can generate same pseudo random numbers. 3. Generate a list of 100 random integer numbers with range from 0 to 100 as x-coordinator, 4. Generate another list of 100 random integer numbers with range from 0 to 100 as y-coordinator, 5. Each of your vertex i 0,...,99 has x-coordinate al1 and y-coordinate yli]. The dis- you can name it as . you can name it as z. tance between any two vertices should be the Euclidean distance between them (d(i,j) - Solve the problem for the shortest path problem from vertex 0 to vertex 99