Implement a Python function called Euler that takes as input a list of pairs representing an undirected graph and returns a list presenting a sequence of edges constituting and Euler path if there is one. If no such path exits, return the empty list. example input: Euler[ [1,2], [1,3], [3,4], [4,5] ]