In a dictionary whose keys are the warehouses: associated with each warehouse is an inner dictionary whose keys are the stocked products (and whose associated values are the inventory of that product in the warehouse). the inventory must always be a non-negative value; an inventory of 0 is legal. for example, a simple/small database might be.

db = {'irvine' : {'brush': 3, 'comb': 2, 'wallet': 2}, 'newport': {'comb': 7, 'stapler': 0},
'tustin' : {'keychain': 3, 'pencil': 4, 'wallet': 3}}

this data structure means that

the irvine warehouse stocks 3 brushes, 2 combs, and 2 wallets.

the newport warehouse stocks 7 combs, and 0 staplers.

the tustin warehouse stocks 3 keychains, 4 pencils, and 3 wallets.

(d) the by_product_inventory function returns a list of 2-tuples (str, int) (product names and inventory), sorted ascending by which products have the largest inventory (the summed over all warehouses). if two products have the same inventory, they should appear in ascending order of product name: for the db dictionary above the result is [('stapler', 0), ('brush', 3), ('keychain', 3), ('pencil', 4), ('wallet', 5), ('comb', 9)].