1. Election Prediction Large corporations do not like unpredictability, so they want a better way to predict the outcome of upcoming elections so they can plan appropriately for future governments. Your company has been asked about the feasibility of building a tool for predicting the results of an upcoming election. You will have access to data about the outcome of previous elections, demographic data from the census about the people in the riding at the time of the election and polling data if it was available. The goal is to predict the probability of which party will win each riding if an election were held today. A rival company has proposed solving it by combining hidden Markov models and relational probabilistic models.

(a) Explain how this problem fits into the abstraction of an agent as studied in this course.

(b) Explain how the rival company’s solution may work, and explain why they may have chosen the technologies they proposed.

(c) What is the most challenging part of solving this problem? What would you recommend as a way to solve this? Justify any recommendation made.