(Solved): Question 1 2 pts House Robbery Consider the House Robbery Problem with parameter k=1 where there m ...

Question 1 2 pts House Robbery Consider the House Robbery Problem with parameter k=1 where there must be at least

house to be skipped between any two houses that will be entered. Use the following partially filled table to answer the following questions. Fill in the house id

below to get the maximum profit. the first house to be entered

the 2 nd house to be entered

the last house to be entered

. The maximum profit is

\table[[House Robbery Problem (k=1)],[House id,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],[Cash ($),9,2,2,8,10,8,5,17,15,3,17,19,3,2,8],[Total profit,9,9,11,17,21,25,26,,,,,,,,],[Rob,,,,,,,,,,,,,,,]] Question 2 4 pts