For this exercise you will write Python code to assist in fairly dividing up tasks between two roommates. You must create a file named tasks.py assign.py $($updated $9/24)$ that contains a single function named assign$\_$task.The assign$\_$task function must take three arguments: a string representing the new task, and

two sets containing the tasks that have already been assigned. The function must return a

Boolean indicating whether the resulting assignment is fair. A fair assignment is any assignment

such that number of elements in each set differs by at most one. Task assignments must satisfy

the following requirements:

There can be no duplicate tasks. If a task already exists in either set, it must be ignored. You

may assume that there will not be duplicate tasks in the provided sets.

New tasks must be added to the set that currently has fewest items. In the case of a tie, the

task must be added to the set associated with the first set argument.

The following interaction provides some examples of the expected behavior:

$$ my$\_$work $=$ set $(["$sweep$",$ "windows", "laundry"$])$

$$ your$\_$work $=$ set $()$

$$ as assign$\_$task$("$tidy$",$ my$\_$work, your$\_$work$)$

False

$$ print$($my$\_$work, your$\_$work$)$

$\{\text{'}$windows$\text{'},$ 'sweep', 'laundry'$\}\{\text{'}$tidy$\text{'}\}$

$$ assign$\_$task$("$sweep$",$ my$\_$work, your$\_$work$)$

False

$$ print$($my$\_$work, your$\_$work$)$

$\{\text{'}$windows$\text{'},$ 'sweep', 'laundry'$\}\{\text{'}$tidy$\text{'}\}$

$$ assign$\_$task$("$garbage$",$ my$\_$work, your$\_$work$)$

True

The assign$\_$task function must take three arguments: a string representing the new task, and two sets containing the tasks that have already been assigned. The function must return a Boolean indicating whether the resulting assignment is fair. A fair assignment is any assignment such that number of elements in each set differs by at most one. Task assignments must satisfy the following requirements:

There can be no duplicate tasks. If a task already exists in either set, it must be ignored. You may assume that there will not be duplicate tasks in the provided sets.

New tasks must be added to the set that currently has fewest items. In the case of a tie, the task must be added to the set associated with the first set argument.

The following interaction provides some examples of the expected behavior:

$>>>$ my$\_$work $=$ set$(["$sweep$",$ "windows", "laundry"$])$

$>>>$ your$\_$work $=$ set$()$

$>>>$ assign$\_$task$("$tidy$",$ my$\_$work, your$\_$work$)$

False

$>>>$ print$($my$\_$work, your$\_$work$)$

$\{\text{'}$windows$\text{'},$ 'sweep', 'laundry'$\}\{\text{'}$tidy$\text{'}\}$

$>>>$ assign$\_$task$("$sweep$",$ my$\_$work, your$\_$work$)$

False

$>>>$ print$($my$\_$work, your$\_$work$)$

$\{\text{'}$windows$\text{'},$ 'sweep', 'laundry'$\}\{\text{'}$tidy$\text{'}\}$

$>>>$ assign$\_$task$("$garbage$",$ my$\_$work, your$\_$work$)$

True