Can you write pseudocode and a flowchart for this java code please

import java.util.Arrays;

public class part2 { public static void main(String[] args) { int [] arr = {2,9,1,2,6,8}; System.out.println("Original Array: " + Arrays.toString(arr)); int n = arr.length; arr = sort(arr); int e = numUniqueArray(arr); System.out.println("Length of Array 'n' = " + n); System.out.println("Unique numbers in Array 'e' = " + e); int [] uniqueArr = uniqueArray(arr,e); System.out.println("Unique Array: " + Arrays.toString(uniqueArr)); } public static int[] uniqueArray(int[] arr, int e) { int a,b; int i = 0; int[]uniqueArr = new int[e]; for (a = 0; a < arr.length; a++) { for (b = 0; b < a; b++) if (arr[a] == arr[b]) break; if (a == b) { uniqueArr[i] = arr[a]; i++; } } return uniqueArr; } public static int numUniqueArray (int[] x) { int numUnique = 1; for(int i = 1; i < x.length; i++) { if(x[i - 1] != x[i]) ++numUnique; } return numUnique; } public static int[] sort (int[] x){ for (int a = 0; a < x.length; a++) { for (int b = a + 1; b < x.length; b++) { int tmp = 0; if (x[a] > x[b]) { tmp = x[a]; x[a] = x[b]; x[b] = tmp; } } } return x; } }