Task 1: Flora and Fauna The kingdoms of Flora and Fauna are at war with each other. The battle has become so intense that no one knows which kingdom will emerge victorious. The inhabitants of the Neutral Land want to know the outcome of the war. However, they are too afraid to go to the battlefield. So, they came up with a plan. They gathered information from the reports of the kingdoms of Flora and Fauna. They found information about all the one-on-one battles between the soldiers of the two kingdoms. They know the names of the soldiers who fought in each battle but don't know which kingdom each soldier belongs to. The inhabitants of the Neutral Land want to determine the maximum possible number of soldiers from either kingdom. Input: The input starts with an integer T(10), denoting the number of test cases. Each case contains an integer n(1n105), representing the number of one-on-one battles. The next n lines will contain two different integers uv(1u,v20000), indicating a battle between soldiers u and v. No battle will be mentioned more than once. Output: For each case, print the case number and the maximum possible number of soldiers from either kingdom. Task 1: Flora and Fauna The kingdoms of Flora and Fauna are at war with each other. The battle has become so intense that no one knows which kingdom will emerge victorious. The inhabitants of the Neutral Land want to know the outcome of the war. However, they are too afraid to go to the battlefield. So, they came up with a plan. They gathered information from the reports of the kingdoms of Flora and Fauna. They found information about all the one-on-one battles between the soldiers of the two kingdoms. They know the names of the soldiers who fought in each battle but don't know which kingdom each soldier belongs to. The inhabitants of the Neutral Land want to determine the maximum possible number of soldiers from either kingdom. Input: The input starts with an integer T(10), denoting the number of test cases. Each case contains an integer n(1n105), representing the number of one-on-one battles. The next n lines will contain two different integers uv(1u,v20000), indicating a battle between soldiers u and v. No battle will be mentioned more than once. Output: For each case, print the case number and the maximum possible number of soldiers from either kingdom