Next most urgent

orders is a list of (priority, name) tuples, lower number meaning more urgent, in no particular order. Write most_urgent(orders) that returns the name of the most urgent order without changing the list. The list has at least one order and no two orders share a priority.

most_urgent([(3, "bread"), (1, "wedding cake"), (2, "sandwiches")])  ->  "wedding cake"

import heapq

def most_urgent(orders):
    ...