The program must print on the screen the minimum paths obtained by Dijkstra's algorithm.

Python Using recursion No loops Print asterisks If k > n, n is negative or zero, or indent is negative, the function does not print anything. It may use string multiplication and formatted strings such s * num for some string s and some integer num   def printStars(k, n, indent):

1. Design an algorithm to find the weighted sum of four test scores (https://en.wikipedia.org/wiki/Weight_function). Assume that the weights have been accurately calculated in advance such that their sum equals one.  Your algorithm must-read in the four test scores and four corresponding weights in the following order: score1 weight1 score2 weight2 score3 weight3 score4 weight4 Write your algorithm such that it can be run with any set of data values. However, you can test your algorithm on the following sample data to verify that the result is 70: 90 0.10 80 0.20 70 0.30 60 0.40   2. Write an algorithm that prompts the user for the radius, in inches, and price of a pizza, and then reads in those values.  Finally, have the algorithm compute and output the pizza’s cost per square inch.   3. Sports exercise advisor algorithm. In this algorithm you will start out with a temperature value in Celsius, so you do not need to ask the user for it. First, convert the temperature to Fahrenheit.…

The bisection of a graph of a graph is defined as the smallest number of crossing edges when dividing the vertices of the graph into two sets of equal size (there is no connectivity requirements for the sets). Write an integer program that computes the bisection of a graph with even number of vertices.