Please help me complete the TODOs below using Python 3.8, please give a screenshot of answers:

"""CSC148 Assignment 1 All of the files in this directory and all subdirectories are: Copyright (c) 2020 Misha Schwartz, Mario Badr, Christine Murad, Diane Horton, Sophia Huynh and Jaisie Sin === Module Description === This file contains classes that define different algorithms for grouping students according to chosen criteria and the group members' answers to survey questions. This file also contain a classe that describes a group of students as well as a grouping (a group of groups). """ from __future__ import annotations import random from typing import TYPE_CHECKING, List, Any from course import sort_students if TYPE_CHECKING: from survey import Survey from course import Course, Student def slice_list(lst: List[Any], n: int) -> List[List[Any]]: """ Return a list containing slices of  in order. Each slice is a list of size  containing the next  elements in . The last slice may contain fewer than  elements in order to make sure that the returned list contains all elements in . === Precondition === n <= len(lst) >>> slice_list([3, 4, 6, 2, 3], 2) == [[3, 4], [6, 2], [3]] True >>> slice_list(['a', 1, 6.0, False], 3) == [['a', 1, 6.0], [False]] True """ # TODO: complete the body of this function def windows(lst: List[Any], n: int) -> List[List[Any]]: """ Return a list containing windows of  in order. Each window is a list of size  containing the elements with index i through index i+ in the original list where i is the index of window in the returned list. === Precondition === n <= len(lst) >>> windows([3, 4, 6, 2, 3], 2) == [[3, 4], [4, 6], [6, 2], [2, 3]] True >>> windows(['a', 1, 6.0, False], 3) == [['a', 1, 6.0], [1, 6.0, False]] True """ # TODO: complete the body of this function class Grouper: """ An abstract class representing a grouper used to create a grouping of students according to their answers to a survey. === Public Attributes === group_size: the ideal number of students that should be in each group === Representation Invariants === group_size > 1 """ group_size: int def __init__(self, group_size: int) -> None: """ Initialize a grouper that creates groups of size  === Precondition === group_size > 1 """ # TODO: complete the body of this method def make_grouping(self, course: Course, survey: Survey) -> Grouping: """ Return a grouping for all students in  using the questions in  to create the grouping. """ raise NotImplementedError class AlphaGrouper(Grouper): """ A grouper that groups students in a given course according to the alphabetical order of their names. === Public Attributes === group_size: the ideal number of students that should be in each group === Representation Invariants === group_size > 1 """ group_size: int def make_grouping(self, course: Course, survey: Survey) -> Grouping: """ Return a grouping for all students in . The first group should contain the students in  whose names come first when sorted alphabetically, the second group should contain the next students in that order, etc. All groups in this grouping should have exactly self.group_size members except for the last group which may have fewer than self.group_size members if that is required to make sure all students in  are members of a group. Hint: the sort_students function might be useful """ # TODO: complete the body of this method class RandomGrouper(Grouper): """ A grouper used to create a grouping of students by randomly assigning them to groups. === Public Attributes === group_size: the ideal number of students that should be in each group === Representation Invariants === group_size > 1 """ group_size: int def make_grouping(self, course: Course, survey: Survey) -> Grouping: """ Return a grouping for all students in . Students should be assigned to groups randomly. All groups in this grouping should have exactly self.group_size members except for one group which may have fewer than self.group_size members if that is required to make sure all students in  are members of a group. """ # TODO: complete the body of this method class GreedyGrouper(Grouper): """ A grouper used to create a grouping of students according to their answers to a survey. This grouper uses a greedy algorithm to create groups. === Public Attributes === group_size: the ideal number of students that should be in each group === Representation Invariants === group_size > 1 """ group_size: int def make_grouping(self, course: Course, survey: Survey) -> Grouping: """ Return a grouping for all students in . Starting with a tuple of all students in  obtained by calling the .get_students() method, create groups of students using the following algorithm: 1. select the first student in the tuple that hasn't already been put into a group and put this student in a new group. 2. select the student in the tuple that hasn't already been put into a group that, if added to the new group, would increase the group's score the most (or reduce it the least), add that student to the new group. 3. repeat step 2 until there are N students in the new group where N is equal to self.group_size. 4. repeat steps 1-3 until all students have been placed in a group. In step 2 above, use the .score_students method to determine the score of each group of students. The final group created may have fewer than N members if that is required to make sure all students in  are members of a group. """ # TODO: complete the body of this method class WindowGrouper(Grouper): """ A grouper used to create a grouping of students according to their answers to a survey. This grouper uses a window search algorithm to create groups. === Public Attributes === group_size: the ideal number of students that should be in each group === Representation Invariants === group_size > 1 """ group_size: int def make_grouping(self, course: Course, survey: Survey) -> Grouping: """ Return a grouping for all students in . Starting with a tuple of all students in  obtained by calling the .get_students() method, create groups of students using the following algorithm: 1. Get the windows of the list of students who have not already been put in a group. 2. For each window in order, calculate the current window's score as well as the score of the next window in the list. If the current window's score is greater than or equal to the next window's score, make a group out of the students in current window and start again at step 1. If the current window is the last window, compare it to the first window instead. In step 2 above, use the .score_students to determine the score of each window (list of students). In step 1 and 2 above, use the windows function to get the windows of the list of students. If there are any remaining students who have not been put in a group after repeating steps 1 and 2 above, put the remaining students into a new group. """ # TODO: complete the body of this method class Group: """ A group of one or more students === Private Attributes === _members: a list of unique students in this group === Representation Invariants === No two students in _members have the same id """ _members: List[Student] def __init__(self, members: List[Student]) -> None: """ Initialize a group with members  """ # TODO: complete the body of this method def __len__(self) -> int: """ Return the number of members in this group """ # TODO: complete the body of this method def __contains__(self, member: Student) -> bool: """ Return True iff this group contains a member with the same id as . """ # TODO: complete the body of this method def __str__(self) -> str: """ Return a string containing the names of all members in this group on a single line. You can choose the precise format of this string. """ # TODO: complete the body of this method def get_members(self) -> List[Student]: """ Return a list of members in this group. This list should be a shallow copy of the self._members attribute. """ # TODO: complete the body of this method class Grouping: """ A collection of groups === Private Attributes === _groups: a list of Groups === Representation Invariants === No group in _groups contains zero members No student appears in more than one group in _groups """ _groups: List[Group] def __init__(self) -> None: """ Initialize a Grouping that contains zero groups """ # TODO: complete the body of this method def __len__(self) -> int: """ Return the number of groups in this grouping """ # TODO: complete the body of this method def __str__(self) -> str: """ Return a multi-line string that includes the names of all of the members of all of the groups in . Each line should contain the names of members for a single group. You can choose the precise format of this string. """ # TODO: complete the body of this method def add_group(self, group: Group) -> bool: """ Add  to this grouping and return True. Iff adding  to this grouping would violate a representation invariant don't add it and return False instead. """ # TODO: complete the body of this method def get_groups(self) -> List[Group]: """ Return a list of all groups in this grouping. This list should be a shallow copy of the self._groups attribute. """ # TODO: complete the body of this method if __name__ == '__main__': import python_ta python_ta.check_all(config={'extra-imports': ['typing', 'random', 'survey', 'course']})