Consider the following problem setup: You are the Head of the Computer Science department, and you are figuring out the tutorial schedule for the Tutors in the department. The department has X Tutors and Y tutorial sessions. Each tutorial session has a known time slot, and fortunately, at most 2 tutorials are in the same time slot. In the Y tutorial sessions, you need exactly Z of them to be exam prep sessions, and the rest to be normal tutorial sessions. The following conditions MUST hold:

-Exactly one Tutor is available for each tutorial
-A tutor cannot conduct 2 tutorials at the same time slot
-Some Tutors do not conduct normal tutorial sessions, some do not conduct exam prep sessions, and others can conduct either.
-If two tutorials are in the same time slot, you also don’t want them to be the same type of session for the sake of best allocation of resources.

Q1. Formulate this as a search problem. Specifically, define the state representation, the successor
function, the start state and the goal test.
Q2.
-Propose a search algorithm to tackle the problem.
If your choice is DFS/BFS, give an explanation for your choice
-If your choice is UCS/Greedy/A* search, explain in a paragraph what cost function and/or heuristic is
being used (A qualitative description of what
the cost function/heuristic does is sufficient).
-Calculate the state space size and the branching factor of the search tree​

Write a program that reads in a series of lines of input character by character (using the library function the first line of the input contains an integer which specifies the number of remaining lines of input, each of which contains a floating point number. the integer value on the first line can be read with (the library function) but all of the following lines can only be read with each line, after the first, contains a single floating point value, with up to four digits before the decimal point, and up to four digits following the decimal point, but there is not necessarily a decimal point in each number; i. e., it may appear to be an integer, but the digits should be read by your program, and the number should be converted to a corresponding floating point number. for instance, suppose the following input: 5 3.1255 20.25 0.875 1921.50 31 the required output is: − each of the input floating point values, printed on a separate line with four digits of precision, using printf(); − on the last line of the output, the string “total: ” followed by the sum of the input values, printed with printf() to 4 digits of precision. for example, the total of the sample input given above is 1976.7505, so the required output for this input would be: 3.1255 20.2500 0.8750 1921.5000 31.0000 total: 1976.7505 do not concern yourself with small differences in the total due to rounding, as the grader will not deduct points for this. constraints: − you are not allowed to use arrays on this portion of the lab assignment. − there is no maximum number of lines allowable. it all depends upon the first value of input. since you aren’t saving anything, it doesn’t matter. − you can assume that input will not contain more than 4 digits before or after the decimal point. you do not need to error check for this condition. -you must use getchar() to read in the floating point values one character at a time (i. e. do not use -you must declare and use your floating point values as a double to minimize rounding errors. -only use printf() to output the floating point numbers and the total (do not use − be sure your directions to the user are clear so they are sure to enter the input data correctly.