During an engagement, a penetration tester needs to organize network host addresses along with an associated list of services running on specific ports for each host. Which data structure is MOST efficient for mapping this type of related information?
Trees with host addresses as root nodes and services as their subsequent branches
Dictionaries with host addresses as keys paired with value lists detailing services
Lists in which host addresses and their corresponding service details are added in order
Sequential arrays where each pair of host addresses and service lists are stored one after the other