(d) Handling sum of one or two negative numbers Method sum for two HugeIntegers where one or both may be negative. Consider the possibilities of adding say three different pairs of integers (or HugeIntegers), where for simplicity, HugeIntegers of smaller magnitude are used as follows: 12345 and -6789, -12345 and 6789, and -12345 and -6789. You may need a related method called subtract which handles the "borrowing" of digits from higher digit (the counterpart of carry). Explain briefly how the three different ways are handled 12345+ (-6789), which is 123456789 -12345 +6789, which is possibly ( 12345-6789). How do you know 12345 is bigger than 6789, or how a HugeInteger a is Greater Than another HugeInteger b (from part (a)) And -12345 + (-6789), (which is - (12345 +6789)

Python Only Write a method that prints the fibonnaci sequence containing only evenor odd numbers. Your method should expect two parameters. One thattells you how many numbers of the sequence you want to see and if thenumbers should be even or odd.Example of Even: 0, 2, 8, 34, 144, 610, 2584 ...Example of Odd: 1, 1, 3, 5, 13, 21, 55, 89 ...

Please explain why this is the correct answer.

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…