Write a Java program for Dijkstra’s algorithm for the shortest path.  Input Vertices and Edges from user and Find the shortest path from the first node as the source to all other nodes as destinations. Run the program and display output samples

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”

You can plot shapes in Python using line graphs in matplot lib by providing the coordinates of the vertices of the shapes as x, y pairs and using the matplotlib.pyplot.plot (i.e. plt.plot) function. Draw a triangle, square, pentagon, hexagon and heptagon. Note: Use symmetry, starting with the origin at (0,0), and set the distance from the origin to the vertex to be of length 1.0 (otherwise this becomes very complicated for some shapes).

Write a program that reads a list of integers from input into an array and outputs "yes" if the list is sorted in ascending order between two provided positions. Otherwise, output "no". The first input specifies the number of items in the list. The next set of inputs is the list. The last two inputs are the start and end positions (inclusive). Assume the list contains less than 20 integers and position 1 is the first element. Ex: If the input is: 8 5 6 7 4 3 2 1 0 1 3 the output is: yes Ex: If the input is: 6 1 2 3 4 5 2 4 6 the output is: no

Create 4 vectors v1 = rep(0, times=6), v2=1:4, v3=1:2, v4=1:3. Calculate v1+v2, v1+v3, v1+v4, v2*v3, v2*v4. What do you find?