I am only in computer science 3 so if you can keep it as simple as possible that would be great!

Write a Java program that takes an integer (n) as an argument and prints (n) poker hands (five cards each, no redrawing) from a shuffled deck (only one deck of cards), different hands should be separated by blank lines. Sort the cards in the hand so that cards of the same suit are grouped together, and within a suit the cards are sorted by value. Cards are sorted into order of increasing value. Note that aces are considered to have the lowest 1. value