Define a set, fruits, containing the user inputs: my$\_$fruit$1,$ my$\_$fruit$2,$ and my$\_$fruit$3.$

Add the user inputs, your$\_$fruit$1$ and your$\_$fruit$2,$ to fruits.

Add the user input, their$\_$fruit, to fruits.

Add your$\_$fruit$1$ to fruits.

Remove my$\_$fruit$1$ from fruits.

Observe the output of each print statement carefully to understand what was done by each task of the program.

Note: For testing purposes, sets are printed using sorted$()$ for comparison, as in the book's examples.

Ex: If the input is:

apple

peach

lemon

apple

pear

plum

the output is:

$[$ 'apple', 'lemon', 'peach'$]$

$[\text{'}$apple$\text{'},$ 'lemon', 'peach', 'pear'$]$

$[\text{'}$apple$\text{'},$ 'lemon', 'peach', 'pear', 'plum'$]$

$[\text{'}$apple$\text{'},$ 'lemon', 'peach', 'pear', 'plum'$]$

$[\text{'}$lemon$\text{'},$ 'peach', 'pear', 'plum'$]$