What is wrong with the given method called intersect that is supposed to take two Maps of strings to integers as parameters and return a new map whose contents are the intersection of the two. The intersection of two maps is defined here as the set of keys and values that exist in both maps. So if some key K maps to value V in both the first and second maps, include it in your result. If K does not exist as a key in both maps, or if K does not map to the same value V in both maps, exclude that pair from your result. For example, consider the following two maps: {J=87, L-62, W-46, A-100, S-80, J-88, K-52, S-95} {L=62, K=52, W=52, J=88, S=80, B=60, L=83, s-87} Calling intersect on the preceding maps would return the following new map (the order of the key/value pairs does not matter): {L-62, S-80, J=88, K-52} Correct the following code by rewriting the correct answer in your textbox: public static Map intersect (Map m1, Map m2){ Set m2Set= new HashSet<>(m2.keySet());// get the keys of map 1 Set m1Set= new HashSet<>(m1.keySet());// get the keys of map 2 m1Set.retainAl1(m2Set); return m1;

What is wrong with the given method called intersect that is supposed to take two Maps of strings to integers as parameters and return a new map whose contents are the intersection of the two. The intersection of two maps is defined here as the set of keys and values that exist in both maps. So if some key K maps to value V in both the first and second maps, include it in your result. If K does not exist as a key in both maps, or if K does not map to the same value V in both maps, exclude that pair from your result. For example, consider the following two maps: {J=87, L-62, W-46, A-100, S-80, J-88, K-52, S-95} {L=62, K=52, W=52, J=88, S=80, B=60, L=83, s-87} Calling intersect on the preceding maps would return the following new map (the order of the key/value pairs does not matter): {L-62, S-80, J=88, K-52} Correct the following code by rewriting the correct answer in your textbox: public static Map intersect (Map m1, Map m2){ Set m2Set= new HashSet<>(m2.keySet());// get the keys of map 1 Set m1Set= new HashSet<>(m1.keySet());// get the keys of map 2 m1Set.retainAl1(m2Set); return m1;

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

See similar textbooks

Similar questions

Java object oriented programmingcreate a program called AddressPeople with 5 attributes
What is a programming language
What Exactly Is an Application Program?
Explain how object-oriented and procedural programming languages differ in functionality.
List and explain java buzzwords. Which factors are making java famous language?
Describe how dictionaries are used in natural language processing tasks, such as text analysis or spell checking.
Compare and contrast procedural versus object-oriented programming languages. Python: what is it and how does it operate as a programming language?
Python language
The terms named above are the building blocks of a high-level programming language.