Complete the ToDo's without changing any variables.

import java.util.List;

import java.util.function.Function;

import java.util.function.BiFunction;

import java.util.function.Predicate;

import java.util.Comparator;

public class fp {

static List map(Iterable l, Function f) {

for (U x: l) {

}

return null;

}

static V foldLeft(V e, Iterablel, BiFunction f){

return null;

}

static V foldRight(V e, Listl, BiFunction f){

return null;

}

static Iterable filter(Iterable l, Predicate p){

return null;

}

static U minVal(Iterable l, Comparator c){

return null;

}

static > int minPos(Iterable l){

return 0;

}

public static void main(String[] args) {

// (1) 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])

// (2) Use foldleft to calculate the sum of a list of integers.

// i.e write a method: int sum(List l)

// (3) Use foldRight to concatenate a list of stringsi.e write a method

// String s (List l)

// (4) consider an array of Persons. Use filter to

// print the names of the Persons whose salary is

// greater than 100000

// (5) Use minVal to calculate the minimum of a List of

// Integers

// (6) Use minVal to calculate the maximum of a List of

// Integers

// (7) Use minPos to calculate the position of the

// minimum in a List of Integers

// (8) Use minPos to calculate the position of the

// minimum in a List of String

}

}

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;}

}