Change Summation Integers problem to Finding the minimum problem. Move System.out.print statements, displaying results inside the methods, making all your methods VOID.

canMove(int x, int y, int destX, int destY, Side s): This method returns true if the player of color s can move the piece at coordinates (x,y) can move to coordinates (destX, destY) on the board in its current state. This means that here you do need to consider this piece’s interaction with other pieces on the board. Conditions for this method to return false are given in the code.   public boolean canMove(int x, int y, int destX, int destY, Side s){        /* TODO write a method that checks if a piece at coordinates x,y can move to coordinates destX,destY        Conditions for false:        - Origin or destination coordinates are outside the board        - Piece at origin is null        - If source and destination coordinates are the same        - Piece at origin is not of the same side as s             - You can check this using piece.getSide()        - Piece cannot move to the destination by piece movement rules             - You should check this using Piece.canMove(destX,…

Write a method (with a parameter n), n: integer type that prints numbers from 1 to n. The print out should be 5 numbers per line. All the output numbers should be aligned well. Call the method with n=13 and n=10 in the main()

I have modified the code above. The input to test the method floydWarshal(graph,v) will come from the user (from the console through the scanner). v can not be a final variable because the user will determine the value of v.   The double array graph will also be determined and input by the user (from the console through the scanner). I'm having issues getting the input from the user and putting it into the double array. I'm also having issues printing the result of the method, which should be the shortest path graph. Please help ------------------------------------------------------------------------------------ HERE IS THE CODE THAT I HAVE SO FAR  import java.io.*;import java.util.*;import java.lang.*; public class Solution {  final static int INF = 99999; public static void shortWarshall(int graph[][],int v) {  int dist[][] = new int[v][v];  int i, j, k;   /* Initialize the solution matrix  same as input graph matrix.  Or we can say the initial values  of shortest distances  are…