Please help me solve this in C$++.$ Those pics are instructions. Assume that the graph is represented as an adjacency list using an STL map, where the key is

a string storing an airport, and the value is an STL set of type string storing the connection. Complete

the implementation of the function printconnections$()$ that passes the STL map and prints all the

airports and their respective connections in this format:

AEY $=>HFNRKV$

BIU $=>$ IFJ $RKV$

Restrictions: You may use ONLY range$-$based FOR loops.

Functions.cpp

#include