java code Write a recursive method called that accepts two

integers and as parameters and returns the number of

unique permutations of given values of and

as follows:

For example,

helpful to note that

items from a group of items. For this value $()$ can be computed

should return $840.$ It may be returns $120,$ or $840/7$