A sorted bag behaves just like a regular bag but allows the user to visit its items in ascending order with the for loop. Therefore, the items added to this type of bag must have a natural ordering and recognize the comparison operators. Some examples of such items are strings and integers. Define a new class named Array Sorted Bag that supports this capability. Like Array Bag, this new class is array based, but its in operation can now run in logarithmic time. To accomplish this, Array Sorted Bag must place new items into its array in sorted order. The most efficient way to do this is to modify the add method to insert new items in their proper places. You also have to include a __contains__ method to implement the new, more efficient search. Finally, you must change all references to Array Bag to be Array Sorted Bag.