The coach of Stony Brook Universitys Basketball team wants to organize practice sessions for the team. He has three time slots, namely, Morning, Afternoon and Evening. He is given the time table of all the students in the form of a 2D list of integers, i.e., a list of lists of integers. You need to help the coach to find an appropriate time where the maximum students are available for practice.

Write the function find practice time(), which takes a single argument: student time tables: a 2D list of integers representing students time table where 1 means that the student is free in that time slot and 0 meaning the student has a class.

Each individual sub-list inside the overall list always have three values: some combination of 0s and 1s. For example, the sub-list [1, 0, 1] means the student is available for practice in the morning and evening, but not in the afternoon.

The following rules apply:

The coach knows that it is impossible for all students to be free at the same time. He will hold practice when maximum number of students are available.

The coach wants to hold practice as early in the day as possible. So, for example, if there is a tie between afternoon and evening, the practice will take place in the afternoon.

It is guaranteed that at least 1 student is free in 1 time slot, i.e. it is not possible to have a list of all zeroes.

The function returns a string Morning, Afternoon or Evening depending on the above rules.

Clearly we need to iterate over all the time slots of all the students. We also could iterate over each of the sub-lists of 3 elements each if we like. See the pseudocode below:

for each sub-list inside student_time_tables: if a student is free in the morning, then add 1 to the count of students available in the morning if a student is free in the afternoon, then add 1 to the count of students available in the afternoon if a student is free in the evening, then add 1 to the count of students available in the evening