Inference Use the example in the picture to solve this.  Given the premises: If the steak is well done, it’s overcooked. If the steak is overcooked, the fire alarm will go off. Either the batteries have been changed or the fire alarm will not go off. The batteries have only been changed if the ladder is in the room. The ladder is not in the room. Conclude that the steak is not well done. These premises don’t make sense in the real world. Why? How can you change the premises so that they make sense in the real world? (They don’t have to end up perfectly correct, but they need to avoid the obvious problems you uncover in part B.) Show step by step how to solve this. Thank you in advanced!

Operating System

Use the predicates Color(x,y,t) – the color of x is y at time t, Later(x,y) – x is later than y, and the constant L1. Write a set of three sentences to describe the behavior of traffic light L1. Its color cycles through the sequence Green -> Yellow -> Red -> Green -> ...

Let's revisit our first problem, where we want to set up a series of chess matches so we can rank six players in our class. As we did before, we will assume that everyone keeps their chess rating a private secret; however, when two players have a chess match, the person with the higher rating wins 100% of the time. But this time, we are only interested in identifying the BEST of these six players and the WORST of these six players. (We don't care about the relative ordering or ranking of the middle four players.) Your goal is to devise a comparison-based algorithm that is guaranteed to identify the player with the highest rating and the player with the lowest rating. Because you are very strong at Algorithm Design, you know how to do this in the most efficient way. Here are five statements. A. There exists an algorithm to solve this problem using 6 matches, but there does not exist an algorithm using only 5 matches. B. There exists an algorithm to solve this problem using 7 matches,…