Information is present in the screenshot and below. Based on that need help in solving the code for this problem in java. The time complexity has to be as less as possible (nlogn or n at best, no n^2). Apply divide and conquer algorithm in the problem. Make sure ALL test cases return expected outputs by providing output screenshots.Hint: Use bisection method / binarySearchOutput FormatThe output contains one line with a single integer: the minimum instability you can achieve modulo 10^9 + 7.Sample Input 02 1 12343Sample Output 030Sample Input 12 2 2142151Sample Output 140Sample Input 22 5 64670132061622Sample Output 2214The actual codeimport java.io.*;import java.util.*;public class Solution { public static final long MOD = 1000000007L; public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader( new InputStreamReader(System.in) ); String[] parts = br.readLine().trim().split(" "); int l = Integer.parseInt(parts[0]); int w = Integer.parseInt(parts[1]); int d = Integer.parseInt(parts[2]); int[] length_costs = new int[l]; int[] width_costs = new int[w]; int[] depth_costs = new int[d]; for(int i = 0; i < l; i++) { length_costs[i] = Integer.parseInt(br.readLine().trim()); } for(int i = 0; i < w; i++) { width_costs[i] = Integer.parseInt(br.readLine().trim()); } for(int i = 0; i < d; i++) { depth_costs[i] = Integer.parseInt(br.readLine().trim()); } System.out.println(solve(l,w,d,length_costs,width_costs,depth_costs)); } /* This function solves a test case. Parameters: l : int - # of length cutting points of quatrum cluster w : int - # of width cutting points of quatrum cluster d : int - # of depth cutting points of quatrum cluster length_costs : int[] - list of length cutting point instability factors width_costs : int[] - list of width cutting point instability factors depth_costs : int[] - list of depth cutting point instability factors Returns: An integer indicating the smallest attainable instability after cutting the cluster down to 1 x 1 x 1 cubes */ public static long solve(int l, int w, int d, int[] length_costs, int[] width_costs, int[] depth_costs) { // TODO }} If we make the first cut along the first length cutting point, the instability increases by 1 multiplied by thenumber of section being cut through. Since this is our first cut, the only section is the entire cluster itself. Afterthe cut, there are now two sections, lengthwise.If we make another cut along the length, this is still only cutting through one segment since this cut will beparallel to the previous cut, and thus will also only cut through one section of the cluster. However, consider ifwe cut through the first width cutting point. Since this cut is orthogonal to the initial cut, we are now cuttingthrough 2 sections of the cluster. Thus, our instability increases by 1 x 2, where 1 is the instability factor ofthe first width cutting point, and 2 is the number of sections we are cutting through.At this point, using one of the length cutting points will cut through 2 sections, since we already cut throughone of the width cutting points. Likewise, using a width cutting point will cut through 2 sections since wealready cut through one of the length cutting points. Consider, however, if we cut using the first depth cuttingpoint. This now passes through 4 sections, since the cross section was cut into two sections lengthwise, andtwo sections widthwise, yielding a total of 4 sections.You want to cut this entire cube into L W D cubes of size 1 x 1 x 1. Find the minimum instability indexattainable. Since this number can be very large, print it modulo 10⁹ + 7.Input FormatInput begins with a line containing three space-separated integers: L – 1, W – 1, and D – 1, indicating thenumber of length, width, and depth cutting points of the quatrum cluster respectively.L – 1 lines follow, the ith of which contains №₁,¿, the instability factor of the ith length cutting point.W - 1 lines follow, the ith of which contains I2,;, the instability factor of the ith width cutting point.D - 1 lines follow, the ith of which contains I3,;, the instability factor of the ith depth cutting point.Constraints1 ≤ L, W, D ≤ 1000010≤ 11., 12., 13.i < 10⁹1,2, Algo-Man and his students, belonging to the Class of '25, while studying algorithms and complexity,accidentally stumbled upon a polynomial time algorithm to one of the illustrious NP-Complete problems. Thiscaused a Quatro Tunnel to appear in their classroom and Algo-Man and his class were sucked into the QuatroRealm. This is a realm where only excellence exists, and if you are deemed inferior by the fabric of existence inthis realm, it wilt halt your ontological inertia and you will cease to exist.Seeking to escape this realm of excellence, Algo-Man and his students are now hatching up a plan to escapeback into their reality. They are able to find the remains of a time and space travelling machine known as theTARDIS (Time And Relative Dimension In Space) and are seeking to repair it to get back to their world.One of the components in need of repair is the energy core of the TARDIS. Algo-Man has determined that oneof the cracked quatrum clusters nearby can be broken down and fed to the TARDIS' energy core.A quatrum cluster is a rectangular prism in dimensions L × W × D. Additionally, due to their inherentperfection, quatrum clusters always have integral dimensions. The TARDIS only accepts 1 × 1 × 1 cubes.Algo-Man has determined that the optimal cutting points of the quatrum clusters is at the integer markers.Using the spare equipment in the TARDIS, Algo-Man has identified the instability factor of each of the cuttingpoints.When cutting across the length of the cluster, there are L – 1 cutting points. The ith of these has aninstability factor of I1,i.When cutting across the width of the cluster, there are W - 1 cutting points. The ith of these has aninstability factor of I2,i.When cutting across the depth of the cluster, there are D - 1 cutting points. The ith of these has aninstability factor of I3,i.When cutting through one of the designated cutting points, this increases the instability of the cluster. Theinstability increases by the instability factor multiplied by the sections of the cluster being cut through.Take for example a 4 × 4 × 4 cluster. The instability factors of the length cutting points is 1, 2, 3. Theinstability factors of the width cutting points is 1, 3, 5. The instability factors of the depth cutting points is4, 1, 2.

Divide and conquer algorithms are a powerful technique for solving complex problems, and they are…

The time complexity has to be as less as possible (nlogn or n at best, no n^2). Apply divide and conquer algorithm in the problem. Make sure ALL test cases return expected outputs by providing output screenshots. Hint: Use bisection method / binarySearch Output Format The output contains one line with a single integer: the minimum instability you can achieve modulo 10^9 + 7. Sample Input 0 2 1 1 2 3 4 3 Sample Output 0 30 Sample Input 1 2 2 2 1 4 2 1 5 1 Sample Output 1 40 Sample Input 2 2 5 6 4 6 7 0 1 3 2 0 6 1 6 2 2 Sample Output 2 214 The actual code import java.io.*; import java.util.*; public class Solution { public static final long MOD = 1000000007L; public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader( new InputStreamReader(System.in) ); String[] parts = br.readLine().trim().split(" "); int l = Integer.parseInt(parts[0]); int w = Integer.parseInt(parts[1]); int d = Integer.parseInt(parts[2]); int[] length_costs = new int[l]; int[] width_costs = new int[w]; int[] depth_costs = new int[d]; for(int i = 0; i < l; i++) { length_costs[i] = Integer.parseInt(br.readLine().trim()); } for(int i = 0; i < w; i++) { width_costs[i] = Integer.parseInt(br.readLine().trim()); } for(int i = 0; i < d; i++) { depth_costs[i] = Integer.parseInt(br.readLine().trim()); } System.out.println(solve(l,w,d,length_costs,width_costs,depth_costs)); } /* This function solves a test case. Parameters: l : int - # of length cutting points of quatrum cluster w : int - # of width cutting points of quatrum cluster d : int - # of depth cutting points of quatrum cluster length_costs : int[] - list of length cutting point instability factors width_costs : int[] - list of width cutting point instability factors depth_costs : int[] - list of depth cutting point instability factors Returns: An integer indicating the smallest attainable instability after cutting the cluster down to 1 x 1 x 1 cubes */ public static long solve(int l, int w, int d, int[] length_costs, int[] width_costs, int[] depth_costs) { // TODO }