1.Implement a Python function called Coloring that takes as input a list of pairs representing the edges of an undirected graph and returns the minimum number of colors needed to color the edges without any two adjacent edges having the same color.

There have been answers to this problem but all have been copy pasted from previous ones and the input is not satisfied. The input has to be in the format provided as a list shown below!

input: Coloring[ [1,2], [1,3], [3,4], [4,5] ]

output: 2