Set and Map data structures are useful structures used in implementation of many $($graph$)$ algorithms. In a few paragraphs, explain the organization and structure of these two ADTs. Give an example of Set or Map function$/$operation then show an example $($code$)$ in JAVA of how the function is utilized. The examples need not be long or complex, but make sure the code is correct and works, and provide a clear explanation of the operations.