You thought that the patterns would never end, but all of the sudden a new message appeared: $$Be wise!$.$ At the same time three bridges appeared: one was over flames, another was over a deep river and the third one was over a flowery field. You decided to take the shortest path but in a wise way. Write a function that takes in three descriptions as strings and returns the shortest one. If there is a tie, you should return the bridge name associated with the shortest description that appears first in the parameter list. def shortest$\_$bridge$($bridge$1,$ bridge$2,$ bridge$3)$: $""">>>$ shortest$\_$bridge$("$flame$",$ "deep river", "flower"$)$ 'bridge$1\text{'}>>>$ shortest$\_$bridge$("$hot flames", "river", "flower"$)$ 'bridge$2\text{'}>>>$ shortest$\_$bridge$("$flame$",$ "river", "calm and green"$)$ 'bridge$1\text{'}>>>$ shortest$\_$bridge$("$very dangerous", "deep river", "red flower"$)$ 'bridge$2\text{'}"""$