Given the following function header: def longest_chain(1st: list[int]) -> int: Given a list of integers, return the length of the longest chain of 1's that start from the beginning. Precondition: 1st is non-empty which one of the cases below is the least useful to check? Select the best answer. o longest chain((0]) O longest_chain([1, 1, O]) O longest_chain([1, 1,0, 1]) O longest_chain([1, 0, 1, 1]) longest_chain(['1; '1, o, '1, 1, 1])

SOLVE STEP BY STEP IN DIGITAL FORMAT PLEASE 5.- The owners of a house want to convert the front steps into a ramp. The porch is 5 feet above the ground and due to building regulations, the ramp must start 12 feet from the base of the porch. How long will the ramp be?

(3) (a) A fair coin is flipped, if it lands on the head side, one dice is rolled and X is the resulted number, if it lands on the tail side, two dice are rolled and X is the resulted sum. Calculate E[X] and V[X]. Write a computer program and carry out a simulation to verify your answers. (b*) A person starts walking home from a bar towards his home. The distance is n blocks. Every hour he either manages to walk one block towards home, or gets confused and picks up a cab back to the bar (each with probability 1/2). At any point, if he is at the bar, he always moves ahead one block. What is the expected time it takes him to get home? (c) Write a computer program' and carry out a simulation to verify your answer. (If you have trouble with part (b), do the computer simulation and formulate a conjecture of the answer for partial credits.)

if it's possible expand each number as a sum of powers of the indicated base . if not explain why not? . and then assume the base 10