Write a method named SwitchPairs that accepts an array of strings as a parameter and switches the order of pairs of values in the array. Your method should swap the order of the first two values, then switch the order of the next two, and so on. For example, if the array stores: String[] a = {"a", "bb", "c", "ddd", "ee", "f", "g"}; switchPairs (a); Your method should switch the first pair ("a", "bb"), the second pair ("c", "ddd") and the third pair ("ee", "f"), to yield this array: {"bb", "a", "ddd", "c", "f", "ee", "g"} If there are an odd number of values, the final element is not moved. You may assume that the array is not null and that no element of the array is null.

Java. Which statements are allowed and which are not allowed? Explain your reasoning for each. (a) brenda.getId(); (b) joe.getId(); (c) brenda.getTerritory();

Please give a full detailed optimized solution in Java 8 for the given problem, use the example code provided as well. Please provide comments and screenshots of code and output. Also, add the time/space complexity and the reason for it.Java 8 Code Example:import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution {     public static void main(String args[] ) throws Exception {         /* Enter your code here. Read input from STDIN. Print output to STDOUT */     } }

Java