1.Write a function : public int max(int[] vec) . It receives a vector of numbers and returs the highest number. 2.Write a function : public int[] merge(int[] v1, int[] v2) . It received 2 vectors of numbers sorted in acsending order and should return a vector with all numbers from v1 and v2 sorted in ascending order 3.Write a function : public boolean duplicates(int[]v1) . It receives a vector of numbers and returns true if there are duplicates in the vector( at least 2 numbers with the same vale) or false if the list does not contains duplicates.