Consider K$14,16($the complete bipartite graph with $14$ nodes on the left and $16$ nodes on the right$).$ Now each edge is colored one of x colors. We want the edges to be colored such that, for any node, all of the edges incident to that node are different colors. What is the minimum value of x necessary? Explain your answer.