1. A Python function, called Divisible Numbers, that takes a list of numbers and a positive n whole, and returns the number of divisible items per n found in the list. In the main part of the program, ask the user to enter the list and the entire n, invoke the function and view the result.

example:

NumberDivisible ([10, 2, 3, 4, 5, 6], 3)

2

Example with the main program:

Please enter a list of inscars by commas: 1.2,3,0.5,-6.9

Please enter a whole positive:

2

The number of elements divisible by 2 is: 3

2. A Python function, called sequenceoftwo, that takes a list of numbers and returns True if there is at least one sequence of two consecutive equal elements, and False if not. In the main part of the program, ask the user to introduce the list, invoke the feature and view the result. Make sure the function is effective, and that it stops as soon as the result is known.

Examples (several executions):

Please enter a list of values separated by commas: 3,1,1,7,5

True

Please enter a list of values separated by commas: 1.6,4,3,3,3

True

Please enter a list of values separated by commas: 2.1,5,3,1,2,1