Write a program Euclidean.java that takes two integer arrays of equal length as vectors and computes the Euclidean distance between them. (HINT: Euclidean distance can be calculated as the square root of the sums of the squares of the differences between corresponding entries.) One example of the two arrays can be - a = (2, 3, 5) and b = (1, 1, 6). You can use any two arrays.