Questioin: Hidden Secret Problem!In this problem, you are given two names, you have to find whether one name is hidden into another. The restrictions are:You can change some uppercase letters to lower case and vice versa.You can add/remove spaces freely.You can permute the letters.And if both the names match exactly, then you can say that one name is hidden into another.InputInput starts with an integer T (≤ 100), denoting the number of test cases.Each case starts with two lines. Each line contains a name consists of upper/lower case English letters and spaces. You can assume that the length of any name is between 1 and 100(inclusive).OutputFor each case, print the case number and Yes if one name is hidden into another. Otherwise print No.SampleInputOutput 3Tom Marvolo RiddleI am Lord VoldemortI am not Harry PotterHi Pretty Roar to manHarry and VoldemortTom and Jerry and Harry Case 1: YesCase 2: YesCase 3: No And I want to flowchart in this problem with code in C program. In this problem, you are given two names, you have to find whether one name is hidden into another. Therestrictions are:1. You can change some uppercase letters to lower case and vice versa.2. You can add/remove spaces freely.3. You can permute the letters.And if both the names match exactly, then you can say that one name is hidden into another.InputInput starts with an integer T (s 100), denoting the number of test cases.Each case starts with two lines. Each line contains a name consists of upper/lower case English letters andspaces. You can assume that the length of any name is between 1 and 100(inclusive).OutputFor each case, print the case number and yes if one name is hidden into another. Otherwise print No .SampleInputOutput3Case 1: YesTom Marvolo RiddleI am Lord VoldemortI am not Harry PotterHi Pretty Roar to manCase 2: YesCase 3: NoHarry and VoldemortTom and Jerry and Harry

Program Plan: Enter the number of cases. Enter the two strings for each case. Convert both the…

Answered: Questioin: Hidden Secret Problem! In…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with two lines. Each line contains a name consists of upper/lower case English letters and spaces. You can assume that the length of any name is between 1 and 100(inclusive).

Output

For each case, print the case number and Yes if one name is hidden into another. Otherwise print No.

Sample

Input	Output
3 Tom Marvolo Riddle I am Lord Voldemort I am not Harry Potter Hi Pretty Roar to man Harry and Voldemort Tom and Jerry and Harry	Case 1: Yes Case 2: Yes Case 3: No