Company: flipkart_8aug
Difficulty: medium
Highest In-Degree Node Problem Description You are given a directed graph represented by a list of edges, where each edge is a tuple of two vertices (u, v), indicating an edge from vertex u to vertex v. The vertices are represented by strings, and the only vertices that exist in the graph are those that appear in the input list of edges. Your task is to write a program that calculates the in-degree of each vertex in the graph and print the vertex name and its in-degree. If more than one node has the highest in-degree, print all such vertices and their in-degrees in alphabetically ascending order. The in-degree of a vertex in a directed graph is the count of incoming edges to that vertex, i.e., the number of edges for which the vertex is the destination. Read the input from STDIN and print the output to STDOUT. Do not write arbitrary strings anywhere in the program, as these contribute to the standard output and test cases will fail. Constraints The input list edges will have at most 10