Consider the following graph G. Write V(G) and E(G)? B D A.

Which of the following is not true of a loop invariant? O If it is True just before entering the loop, it must also be True right after executing the last line of the loop, even if it temporarily stops being True somewhere within the body of the loop. O It is a proposition, and therefore evaluates to a True or False value. O It must be a tautology. O If the loop invariant is True before entering a loop, the loop entry condition may still be False, meaning that the loop would not be executed and the loop invariant would remain True by default.

Let P(x, y) is "x + 2y = xy," where x and y are integers. Given: (1) ForEvery x ThereExists y P(x, y). (2) ThereExists y ForEvery x P(x, y). Select one of the following choices: a. (1) and (2) are True. ○ b. (1) and (2) are False. c. (1) is False and (2) is True. ○ d. (1) is True and (2) is False.

Your team was asked to program a self-driving car that reaches its destination with minimum travel time. Write an algorithm for this car to choose from two possible road trips. You will calculate the travel time of each trip based on the car current speed and the distance to the target destination. Assume that both distances and car speed are given