The below is using Python programming

Write a complete program that generates K number of Mark 6 entries of N numbers, where all the numbers appear at most once. You do not bet on Mark 6? You may read the following specification instead. Write a program that generates K lists of N random numbers in the range 1 to 49, and none of the drawn random numbers appears more than once. K and N comes from the input, where 1

Enter how many numbers in each entry (N): 6 Enter how many entries (K): 4 The 4 entries generated: [42, 31, 29, 18, 25, 14] [28, 26, 43, 39, 7, 15] [45, 5, 8, 23, 35, 21] [40, 48, 30, 13, 46, 34]