Based on the information in the screenshots, please answer the following question below. The language used is Java and please provide the code for it with the explanation. Create a testing class named...

Based on the information in the screenshots, please answer the following question below. The language used is Java and please provide the code for it with the explanation.

Create a testing class named “PlanTest”. Under this class, there needs to be another static method besides the main method:

1. You will need to create a static method named “prerequisiteGenerator” under “PlanTest”, which return a random 2D array containing prerequisite pairs (e.g., {{1, 3}, {2, 3}, {4, 2}}). The value range of a random integer is [0, 10] (inclusive). This method will accept an integer parameter, which specifies the length of the returned array:

int[][] pre = prerequisiteGenerator(3); // possibly {{1, 3}, {2, 3}, {4, 2}}

1. Under the main method, you will need to useprerequisiteGeneratorto generate random prerequisite pair lists, and perform tests on plan method at least three examples by printing proper messages.

Given 4 courses and prerequisites as [[1,0], [2,0], [3,1]]

It is possible to take all the given courses.

A possible schedule is 0, 1, 2, 3.

Please give the below code.

import java.util.*;

public class PlanTest {
public static void main(String[] args) {

}

// this method generates a list of prerequisits as a 2D array
private int[][] prerequisiteGenerator(int size) {
// remove these two lines
int[][] result = new int[1][1];
return result;
}
}

Extracted text: Ехample 2: 2, [[1,01,[0,1]] Output: It is impossible to take all the given courses. Explanation: There are a total of 2 courses to take. To take course 1 you should have finished course 0, and to take course 0 you should also have finished course 1. This class needs to be named “CoursePlanner". The methods that solve the problem w are arranged as plan: this method returns no value and prints out (b) whether it is possible to take all the given courses and (b) what a possible schedule looks like. check: this method returns a boolean value to indicate whether it is possible to take all the given courses. This method can be seen as a helper for plan


Extracted text: Suppose you are working on creating an automatic course planner for WWU students. A student can get a total ofn courses, labeled from 0 ton - 1. Some courses may have prerequisites, for example, to take course 241 you have to first --. take course 145, which is expressed as a pair: [241, 145] (the current course, the prerequisite of the current course). Given the total number of courses and a list of prerequisite pairs, you need to: Determine if it is possible to finish taking the n courses. If not, print “It is impossible to take all the given courses." If yes, print "It is possible to take all the given courses.", and move to the next step. Generate one schedule of the given courses (prerequisites have to be scheduled first for any courses). Print the courses out with white spaces as separators. There might be multiple valid schedules, but you only need to generate one of them. Еxample 1: 4, [[1,0], [2,0], [3,1]] Output: It is possible to take all the given courses. A possible schedule is 0, 1, 2, 3. Explanation: There are a total of 4 courses to take. To take courses 1 or 2 you should take course 0 first. To take course 3, you should take 1 first.