This is what im following my_flower1 = input() my_flower2 = input() my_flower3 = input() your_flower1 = input() your_flower2 = input() their_flower = input() # 1. TODO: Define my_list containing my_flower1, my_flower2, and my_flower3 # in that order # 2. TODO: Define your_list containing your_flower1 and your_flower2 # in that order # 3. TODO: Define our_list by concatenating my_list and your_list print(our_list) # 4. TODO: Append their_flower to the end of our_list print(our_list) # 5. TODO: Replace my_flower2 in our_list with their_flower print(our_list) # 6. TODO: Remove the first occurrence of their_flower from # our_list without using index() print(our_list) # 7. TODO: Remove the second element of our_list print(our_lis
This is what im following
my_flower1 = input()
my_flower2 = input()
my_flower3 = input()
your_flower1 = input()
your_flower2 = input()
their_flower = input()
# 1. TODO: Define my_list containing my_flower1, my_flower2, and my_flower3
# in that order
# 2. TODO: Define your_list containing your_flower1 and your_flower2
# in that order
# 3. TODO: Define our_list by concatenating my_list and your_list
print(our_list)
# 4. TODO: Append their_flower to the end of our_list
print(our_list)
# 5. TODO: Replace my_flower2 in our_list with their_flower
print(our_list)
# 6. TODO: Remove the first occurrence of their_flower from
# our_list without using index()
print(our_list)
# 7. TODO: Remove the second element of our_list
print(our_list)
![3.20 LAB: List basics
Given the user inputs, complete a program that does the following tasks:
• Define a list, my_list, containing the user inputs: my_flower1, my_flower2, and my_flower3 in the same order.
• Define a list, your_list, containing the user inputs, your_flower1 and your_flower2, in the same order.
• Define a list, our_list, by concatenating my_list and your_list.
Append the user input, their_flower, to the end of our_list.
Replace my_flower2 in our_list with their_flower.
• Remove the first occurrence of their_flower from our_list without using index().
• Remove the second element of our_list.
Observe the output of each print statement carefully to understand what was done by each task of the program.
Ex: If the input is:
rose
peony
lily
rose
daisy
aster
the output is:
['rose', 'peony', 'lily', 'rose', ' daisy']
['rose', 'peony', 'lily', 'rose', 'daisy', ' aster']
['rose', 'aster', 'lily', 'rose', 'daisy', ' aster']
['rose', 'lily', 'rose', 'daisy', 'aster']
['rose', 'rose', 'daisy', 'aster' ]](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F7bd0d597-c08e-4cd9-8e43-f0a3b8f6b696%2Fc7b36ed1-5a0e-4e23-beeb-06a42ff180ff%2Fp4krnsb_processed.jpeg&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
According to the question below the Solution:
Output:
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 3 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)