This program illustrates the lower_bound() member function of the map interface. Press Enter to continue ... Suppose we begin with a map containing the following pairs: D 68 E 69 F 70 G 71 H 72 I 73 J 74 K 75 L 76 M 77 Press Enter to continue ... We use the lower_bound() function to find the lower bound for a key in the map, then for a key that precedes any key in the map, and finally for a key that follows all keys in the map. Press Enter to continue ... The lower bound for the key H is the position of this pair: H 72 Press Enter to continue ... The lower bound for the key A is the position of this pair: D 68 Press Enter to continue ... The lower bound for the key T is the one-past-the-last position. Press Enter to continue ...