it's a java programming. Please help me with these problems with an easy way so that I can understand the process. otherwise, I have to repost it again. thanks

P6.11 Write a method public static boolean sameElements (int] a, intl] b) that checks whether two arrays have the same elements in some order, with the same multiplicities. For example, 1 4 9 16 9 7 4 9 11 an 11 1 4 9 16 9 7 49 would be considered identical, but 1 4 9 16 9 7 4 9 11 an 1 11 79 16 4 1 49 would not. You will probably need one or more helper methods. P6.12 A run is a sequence of adjacent repeated values. Write a program that generates a sequence of 20 random die tosses in an array and that prints the die values, marking the runs by including them in parentheses, like this: 12 (5 5) 3 1 24 3 (2 2 2 2) 3 6 (5 5) 6 3 1 Use the following pseudocode: Set a boolean variable inRun to false. For each valid index i in the array If inRun If values[i) is different from the preceding value Print). nRun false. If not inRun If valuesi] is the same as the following value Print ( inRun true. Print valuesti). If inRun, print P6.13 Write a program that generates a sequence of 20 random die tosses in an array and that prints the die values, marking only the longest run, like this: 125 5 3 1 243 (2 2 2 2) 36556 3 1 If there is more than one run of maximum length, mark the first one