Write a method that returns the number from array 'nums' with the greatest number of distinct (different) factors that appear in array 'nums'. Keep in mind that those factors have to appear IN 'nums'! This is not just about which number has the greatest number of distinct factors. It is about which has the greatest number of distinct factors that appear in the array! This is also NOT about PRIME factors. Any distinct factors that appear in the array count. For clarity: 32 has the following distinct factors: 2, 4, 8, and 16. The number itself does not count as a factor, nor does 1. As preconditions you may assume that 'nums' will have no duplicates, that every element will be 2 or greater, and that there will be a number in 'nums' that has strictly MORE distinct factors than any of the other numbers in 'nums' (no ties for most distinct factors). Return the number with the most distinct factors in 'nums'. Look at the test data for examples.