The little diner keeps every dish's price in a list. Write priciest(prices) to return the highest price. There is always at least one dish.
priciest([28, 45, 32])→45priciest([12])→12def priciest(prices):
# your code here: the biggest number in the list
return 0
Run tries the examples. When they look right, Submit.