How can i solve this question on beecrowd problem name Vehicula Restriction number 2712 i need a solution that consists of 4 methods, the first one should return true if the character is upper case or false otherwise (with one char as input parameter) the sec should return true if the character represents a digit or false otherwise (with one char as input parameter) and the third return true if the String represents a valid car plate in the correct format and the fourth should only The method should display the day corresponding to the digit (provided as the input parameter) and should be called from the main method only if the given number plate is in the correct format. character (representing the last digit of the valid car plate number as input parameter) i really needs a solution with these method but i also could use the help of a normal solution without methods

The vehicle restriction of So Paulo city is a restriction on the circulation of motor vehicles in the city. Implemented since 1996 with the aim of improving environmental conditions by reducing the burden of pollutants in the atmosphere, it has consolidated itself as an instrument to reduce congestion in the main highways of the city, during peak times. In the boundary ways, traffic of trucks and automobiles that are within the restriction is not allowed. There is a scale that determines on which days of the week which vehicles can not travel. This scale is governed by the last digit of the vehicle nameplate, being: - Monday, final digit of board 1 and 2 - Tuesday, final digit of plate 3 and 4 - Wednesday, digit end of plate 5 and 6 - Thursday, final digit of plate 7 and 8 - Friday, final digit of plate 9 and 0 The drivers who are caught violating the traffic restriction are charged with a fine and four points in the driver's license. Input The first entry line represents the number of N tests (1<>