Need help with a quick Java problem please! Will upvote answer! Finish the code in the attached Java file:

Here is the Copy/Pasteable code:

import java.util.List; import java.util.function.Function; import java.util.function.BiFunction; import java.util.function.Predicate;

public class hw2 { static List map(Iterable l, Function f) { return null; }

static V foldLeft(V e, Iterablel, BiFunction f){ return null; }

static V foldRight(V e, Listl, BiFunction f){ return null; }

static List filter(List l, Predicate p){ return null; }

static U binFoldLeft(U e, Listl, BiFunction f){ return null; }

public static void main(String[] args) { // Use map to implement the following behavior (described in Python). i.e given a List create a List of the hashes of the objects. // names = ['Mary', 'Isla', 'Sam'] // for i in range(len(names)): // names[i] = hash(names[i]) // Use foldleft to calculate the sum of a list of integers. // i.e write a method: int sum(List l) // Use foldRight to concatenate a list of strings i.e write a method // String s (List l) // consider an array of Persons. Use filter to // print the names of the Persons whose salary is // greater than 100000 //Use binFoldLeft to find the number of occurrences // of 5 in an array of integers

}

}

class Person{ final int salary; final String name; Person(int salary, String name){ this.salary = salary; this.name = name; } int getSalary() { return salary; } String name() { return name;} }

import Java.util.List mport Java.util.function. Function: import java.util. function.Predicate: public class hx2 { 4 1mport Java.util.function.B1Function; static 9 10 return null: List map (Iterable 1, Function f) { 12 13 14 static V foldLeft (V e, Iterablel, BiFunction f)t 15 16 17 18 19 20 21 static V foldRight(v e, List, BiFunction r) return null; return null: 23 24 25 26 27 28 29 30 static List filter (List 1, Predicate p) { return null: 32 static U binFoldLeft (U 34 35 e, List1, BiFunctionU,U,U> f) { return null: 37 38 39 40 public static void main (Stringl args) i // Use map to implement the following behavior (described in Python1.e given a List create a ListcInteger> of the hashes of the objects // names'MaryIsla', 'Sam'] // for i in range (len (names)): // nanes[i-hash (names [i]) 42 43 // Use foldleft to calculate the sum of a 1ist of integers // i.e write a method: int sum (List 1) 45 46 47 4 8 49 50 51 52 53 54 // Use foldRight to concatenate a list of strings 1.e write a method // String s (List 1) /I consider an array of Persons. Use filter to // print the names of the Persons whose salary is // greater than 100000 //U3e binFoldLeft t find the number of occurrences /l of 5 in an array of integers 56 57 56 57 58 59 6i11 61 62 class Person{ 63 64 65 final int salary; final String name Person (int salary, String name) 67 68 69 70 71 72 73 7 4 this.salary-salary: this.name name: int getSalary return salary; > String name) return name: import Java.util.List mport Java.util.function. Function: import java.util. function.Predicate: public class hx2 { 4 1mport Java.util.function.B1Function; static 9 10 return null: List map (Iterable 1, Function f) { 12 13 14 static V foldLeft (V e, Iterablel, BiFunction f)t 15 16 17 18 19 20 21 static V foldRight(v e, List, BiFunction r) return null; return null: 23 24 25 26 27 28 29 30 static List filter (List 1, Predicate p) { return null: 32 static U binFoldLeft (U 34 35 e, List1, BiFunctionU,U,U> f) { return null: 37 38 39 40 public static void main (Stringl args) i // Use map to implement the following behavior (described in Python1.e given a List create a ListcInteger> of the hashes of the objects // names'MaryIsla', 'Sam'] // for i in range (len (names)): // nanes[i-hash (names [i]) 42 43 // Use foldleft to calculate the sum of a 1ist of integers // i.e write a method: int sum (List 1) 45 46 47 4 8 49 50 51 52 53 54 // Use foldRight to concatenate a list of strings 1.e write a method // String s (List 1) /I consider an array of Persons. Use filter to // print the names of the Persons whose salary is // greater than 100000 //U3e binFoldLeft t find the number of occurrences /l of 5 in an array of integers 56 57 56 57 58 59 6i11 61 62 class Person{ 63 64 65 final int salary; final String name Person (int salary, String name) 67 68 69 70 71 72 73 7 4 this.salary-salary: this.name name: int getSalary return salary; > String name) return name