1. Break The Prison Problem Ninja is trapped in a prison and plans to escape through its gate. The gate consists of horizontal and vertical bars spaced one unit apart, creating holes of area 1 * 1 between them. Ninja can remove some bars to enlarge these holes. Your task is to find the area of the largest hole in the gate after removing certain bars. Example: Input: N = 8, M = 8, H = [4], V = [6] Output: 4 Explanation: The biggest hole area becomes (2 * 2) when the 4th horizontal bar and 6th vertical bar are removed. Input The first line contains an integer 'T' which denotes the number of test cases. Each test case consists of: Two space-separated integers 'N' and 'M' denoting the number of horizontal and vertical bars respectively. A line with integer 'X', the number of removable horizontal bars. An array 'H' of 'X' space-separated integers representing the indices of removable horizontal bars. A line with integer 'Y', the number of removable vertical bars. An array 'V' of 'Y' space-separated integers representing the indices of removable vertical bars. Output For each test case, output the area of the largest hole in the gate after the bars are removed. Constraints: 1 <= T <= 5 1 <= N <= 100 1 <= M <= 100 1 <= X <= N 1 <= Y <= M 1 <= |H| <= N 1 <= |V| <= M Note: You do not need to input or print anything; it has been handled. Just implement the given function.
2. What is the difference between issues and risks?
3. Describe a real-time scenario where you used Java arrays in coding.
4. What is load average?