The game of not being caught by a monster is played on a 15X15 game track. The game has two difficulty levels, easy (k / K) and hard (z / Z). A random number of monsters, ranging from 3 to 7 in easy level and 16 to 32 in hard level, are placed on the track in a random manner. On the track, the value zero (0) represents empty places and one (1) represents places with monsters. Write the C program, which will find the number of the first column that the player can pass straight from the north to the south of the track without encountering any monster, and write it on the screen in accordance with the example study below. NOTE: If there is no column that can be passed without encountering any monster, the message "It is NOT possible to go south straight" should be given. CASE STUDY 1: Enter the difficulty level code of the game (K / k: Easy, Z / z: Hard): M Wrong level code entered CASE STUDY 2: Enter the difficulty level code of the game (K / k: Easy, Z / z: Hard): Z