ALGORITHM 1 A Procedure for Computing the Transitive Closure. procedure transitive closure (MR: zero-one n x n matrix) A := MR B = A for i:= 2 to n A := A OMR BBVA return B{B is the zero-one matrix for R*}

using the while loop to output the result of the picture(python) please copy the code

You will be given a list of tuples where each tuple indicates a point i.e. (x, y) in a 2-dimensional coordinate system. You need to write a python program to find the minimum distance and the point that is closest to the origin i.e. (0,0) ===================================================== Hint: The formula of distance = √((Δx)2+(Δy)2) As you are calculating the distance from the origin (0,0), you can simply usedistance = √(x2+y2) You can create a list of distances from each point and sort that list using your personal favorite sorting algorithm. You can use python build-in functions for list: list.index(), min() ===================================================== Sample Input 1 [(5,3), (2,9), (-2,7), (-3,-4), (0,6), (7,-2)] Sample Output 1 The closest point is (-3, -4) which has a distance of 5.0 from the origin. ===================================================== Sample Input 1 [(1,7), (4,5), (-1,7), (-2,0), (1,1), (5,-1)] Sample Output 1 The closest point is (1, 1) which has a…

write in python there are two variables a and z that hold integer numbers where a <=z. Using loops print the following: all the numbers from a to z inclusive. the sum of the numbers from a to z inclusive. Verify that your program works by changing the values of a and z. a=7 and z=15