Find the Best and Worst Completion of a Partial Numeric Hand

Consider a five-card hand game in which each card is a digit from 1 to 9, and repeated digits are allowed. You are given partial_hand, a prefix whose length is between 0 and 5. Append one digit at a time until the final hand has exactly five cards; every appended position may independently be any digit from 1 through 9. The completed hand must start with partial_hand. Implement complete_hands(partial_hand), returning a two-element list [best_hand, worst_hand] where best_hand…