Please I need Task 2 and Task 3 in Java only.

Task 2 Given two vectors of length N that are represented with one-dimensional arrays, write a code fragment that computes the Euclidean distance between them (the square root of the sums of the squares of the differences between corresponding entries). Sample run: Enter the size of the vectors: 3 Enter 3 coefficients of the first vector: 1 2 3 Enter 3 coefficients of the second vector: 1 2 1 The Euclidean distance is: 2 Task 3 Redo Task 2 using a method. The method should take two arrays and should return the Euclidean distance