Alice is going for a drive. During her drive, she reached a maximum speed of 𝑆S km/hr.As per the rules of the government, the speed of the vehicle must not exceed 4040 km/hr, otherwise the person will be fined.You need to tell whether Alice will be fined or not.Input FormatThe only line of input will contain a single integer 𝑆S - denoting the maximum speed Alice reached while driving.Output FormatPrint YES if Alice will be fined , otherwise print NO.You may print each character of the string in uppercase or lowercase (for example, the strings YES, yEs, yes, and yeS will all be treated as identical).Constraints1≤𝑆≤501≤S≤50Sample 1:InputOutput40NOExplanation:Since Alice's speed does not exceed 4040, she will not be fined.Sample 2:InputOutput41YESExplanation:Since Alice's speed exceeds 4040, she will be fined.

Chef was driving on a highway at a speed of 𝑋X km/hour.To avoid accidents, there are fine imposed on overspeeding as follows:No fine if the speed of the car ≤70≤70 km/hour.Rs 500500 fine if the speed of the car is strictly greater than 7070 and ≤100≤100.Rs 20002000 fine if the speed of the car is strictly greater than 100100.Determine the fine Chef needs to pay.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of a single integer 𝑋X denoting the speed of Chef's car.Output FormatFor each test case, output the fine paid by Chef.Constraints1≤𝑇≤2001≤T≤2001≤𝑋≤2001≤X≤200Sample 1:InputOutput74011070100691018502000050002000500Explanation:Test case 11: The speed is ≤70≤70. Thus, Chef does not need to pay any fine.Test case 22: The speed is greater than 100100. Thus, Chef needs to pay 20002000 as fine.Test case 33: The speed is ≤70≤70. Thus, Chef does not need to pay any fine.Test case 44: The speed is greater than 7070 and ≤100≤100. Thus, Chef needs to pay 500500 as fine amount.Test case 55: The speed is ≤70≤70. Thus, Chef does not need to pay any fine.Test case 66: The speed is greater than 100100. Thus, Chef needs to pay 20002000 as fine.Test case 77: The speed is greater than 7070 and ≤100≤100. Thus, Chef needs to pay 500500 as fine amount.

Single File Programming QuestionProblem StatementA traffic monitoring system needs a program to assess and report a driver's speed based on the road type and the current speed. The program should take two inputs: the road type (1 for residential, 2 for city, 3 for highway) and the driver's current speed. The system should then determine whether the driver is below, at, or above the speed limit for the given road type.The speed limits for each road type are as follows:Residential: 25 km/hCity: 35 km/hHighway: 55 km/hThe output is one of the following:"Below" if the current speed is below the speed limit."Normal" if the current speed is equal to the speed limit."Above" if the current speed is above the speed limit.Input format :The first line consists of an integer representing the user's choice (1 for City Roads, 2 for Residential Areas, 3 for Highways).The second line consists of an integer representing the vehicle's speed.Output format :Depending on the selected option, the program displays one of the following messages:"Below" if the current speed is below the speed limit."Normal" if the current speed is equal to the speed limit."Above" if the current speed is above the speed limit.Refer to the sample output for formatting specifications.Code constraints :In the given scenario, the test cases will fall under the following constraints:1 ≤ choice ≤ 30 < current speed ≤ 100Sample test cases :Input 1 :120Output 1 :BelowInput 2 :125Output 2 :NormalInput 3 :230Output 3 :BelowInput 4 :3100Output 4 :AboveInput 5 :299Output 5 :AboveNote :The program will be evaluated only after the “Submit Code” is clicked.Extra spaces and new line characters in the program output will result in the failure of the test case.Marks : 10

Implement two vehicle classes: Car:The constructor for Car must take two arguments. The first of them is its maximum speed, and the second one is a string that denotes the units in which the speed is given: either "km/h" or "mph".The class must be implemented to return a string based on the arguments. For example, if car is an object of class Car with a maximum speed of 120, and the unit is "km/h", then printing car prints the following string: "Car with the maximum speed of 120 km/h", without quotes. If the maximum speed is 94 and the unit is "mph", then printing car prints in the following string: "Car with the maximum speed of 94 mph", without quotes. Boat:The constructor for Boat must take a single argument denoting its maximum speed in knots.The class must be implemented to return a string based on the argument. For example, if boat is an object of class Boat with a maximum speed of 82, then printing boat prints the following string: "Boat with the maximum speed of 82 knots", without quotes. The implementations of the classes will be tested by a provided code stub on several input files. Each input file contains several queries, and each query constructs an object of one of the classes.  It then prints the string representation of the object to the standard output. Constraints1 ≤ the number of queries in one test file ≤ 100 Input Format Format for Custom TestingIn the first line, there is a single integer, q, the number of queries.Then, q lines follow. In the ith of them, there are space-separated parameters. The first of them denotes the vehicle type to be constructed, and the remaining parameters denote the values passed for the constructor of the object.Sample Case 0Sample InputSTDIN      Function-----      -------2 → number of queries, q = 2car 151 km/h → query parameters = ["car 151 km/h", "boat 77"]boat 77Sample OutputCar with the maximum speed of 151 km/hBoat with the maximum speed of 77 knotsExplanationThere are 2 queries. In the first of them, an object of class Car with the maximum speed of 151 in km/h is constructed, and then its string representation is printed to the output. In the second query, an object of class Boat is constructed with the maximum speed of 77 knots, and then its string representation is printed to the output.Sample Case 1Sample InputSTDIN      Function-----      --------3 → number of queries, q = 2boat 101 → query parameters = ["boat 101", "car 120 mph", "car 251 km/h"]car 120 mphcar 251 km/hSample OutputBoat with the maximum speed of 101 knotsCar with the maximum speed of 120 mphCar with the maximum speed of 251 km/hExplanationThere are 3 queries. In the first of them, an object of class Boat with the maximum speed of 101 knots is constructed, and then its string representation is printed to the output. In the second query, an object of class Car with the maximum speed of 120 in mph is constructed, and then its string representation is printed to the output. In the third query, an object of class Car with the maximum speed of 251 in km/h is constructed, and then its string representation is printed to the output.

Four friends want to attend a concert. Each ticket costs 𝑋X rupees.They have decided to go to the concert if and only if the total cost of the tickets does not exceed 10001000 rupees.Determine whether they will be going to the concert or not.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of a single integer 𝑋X, the cost of each ticket.Output FormatFor each test case, output YES if they will be going to the concert, NO otherwise.You can print each character in uppercase or lowercase. For example, the strings YES, yes, Yes, and yES, are all considered identical.Constraints1≤𝑇≤1001≤T≤1001≤𝑋≤10001≤X≤1000Sample 1:InputOutput41005002501000YESNOYESNOExplanation:Test case 11: The total cost of all tickets is 100⋅4=400100⋅4=400 which is ≤1000≤1000. Thus, they will go to the concert.Test case 22: The total cost of all tickets is 500⋅4=2000500⋅4=2000 which is >1000>1000. Thus, they will not go to the concert.Test case 33: The total cost of all tickets is 250⋅4=1000250⋅4=1000 which is ≤1000≤1000. Thus, they will go to the concert.Test case 44: The total cost of all tickets is 1000⋅4=40001000⋅4=4000 which is >1000>1000. Thus, they will not go to the concert.

In a classic chase, Tom is running after Jerry as Jerry has eaten Tom's favourite food.Jerry is running at a speed of 𝑋X metres per second while Tom is chasing him at a speed of 𝑌Y metres per second. Determine whether Tom will be able to catch Jerry.Note that initially Jerry is not at the same position as Tom.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of two space-separated integers 𝑋X and 𝑌Y — the speeds of Jerry and Tom respectively.Output FormatFor each test case, output on a new line, YES, if Tom will be able to catch Jerry. Otherwise, output NO.You can print each character in uppercase or lowercase. For example NO, no, No, and nO are all considered the same.Constraints1≤𝑇≤1001≤T≤1001≤𝑋,𝑌≤101≤X,Y≤10Sample 1:InputOutput42 34 11 13 5YESNONOYESExplanation:Test case 11: Jerry is running at the speed of 22 metres per second while Tom is chasing him at the speed of 33 metres per second. Since Jerry's speed is less than Tom's, Tom will eventually catch Jerry.Test case 22: Jerry is running at the speed of 44 metres per second while Tom is chasing him at the speed of 11 metres per second. Since Jerry's speed is higher than Tom's, Tom will never be able to catch Jerry.Test case 33: Jerry is running at the speed of 11 metre per second while Tom is chasing him at the speed of 11 metre per second. Since Jerry's speed is same as that of Tom's and both of them are not at the same position, Tom will never be able to catch Jerry.Test case 44: Jerry is running at the speed of 33 metres per second while Tom is chasing him at the speed of 55 metres per second. Since Jerry's speed is less than Tom's, Tom will eventually catch Jerry.