CHALLENGE 4.4.2: Set theory methods. ACTIVITY The following program includes 10 cities that two people have visited. Write a program that creates: 1. A set all cities that contains all of the cities both people have visited. 2. A set same_cities that contains only cities found in both person1_cities and person2_cities. 3. A set different_cities that contains cities found only in person1_cities or only in person2_cities. Sample output for all cities: ['Accra', 'Anaheim', 'Bangkok', 'Bend', 'Boise', 'Buenos Aires', 'Cairo', 'Edmonton', 'Lima', 'London', 'Memphis', 'Orlando', 'Paris', 'Seoul', 'Tokyo', 'Vancouver', 'Zurich'] NOTE: Because sets are unordered, they are printed using the sorted() function here for comparison.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
100%

write in python

CHALLENGE 4.4.2: Set theory methods.
ACTIVITY
The following program includes 10 cities that two people have visited. Write a program that creates:
1. A set all cities that contains all of the cities both people have visited.
2. A set same_cities that contains only cities found in both person1_cities and
person2_cities.
3. A set different cities that contains cities found only in person1_cities or only in
person2_cities.
Sample output for all cities:
['Accra', 'Anaheim', 'Bangkok', 'Bend', 'Boise', 'Buenos Aires', 'Cairo',
'Edmonton', 'Lima', 'London', 'Memphis', 'Orlando', 'Paris', 'Seoul',
'Tokyo', 'Vancouver', 'Zurich']
NOTE: Because sets are unordered, they are printed using the sorted() function here for comparison.
Transcribed Image Text:CHALLENGE 4.4.2: Set theory methods. ACTIVITY The following program includes 10 cities that two people have visited. Write a program that creates: 1. A set all cities that contains all of the cities both people have visited. 2. A set same_cities that contains only cities found in both person1_cities and person2_cities. 3. A set different cities that contains cities found only in person1_cities or only in person2_cities. Sample output for all cities: ['Accra', 'Anaheim', 'Bangkok', 'Bend', 'Boise', 'Buenos Aires', 'Cairo', 'Edmonton', 'Lima', 'London', 'Memphis', 'Orlando', 'Paris', 'Seoul', 'Tokyo', 'Vancouver', 'Zurich'] NOTE: Because sets are unordered, they are printed using the sorted() function here for comparison.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Lower bounds sorting algorithm
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education