This is a group assignment of two. This assignment asks you to prepare a meaningful report that answer the following questions: Part A: Searching Technique Given the following start state and goal state of a puzzle. Solve the puzzle problem using A* Search Algorithm. Rules for solving the puzzle: The empty space can only move in four directions; Up, Down, Right or Left The empty space cannot move crossways and can take only one step at a time By using A * Search, the searching is based on f(n)=g(n)+h(n) where h(n) is the number of misplaced tiles by comparing the current state and the goal state and g(n) is the number of nodes traversed from the start node to current node. Initial State Goal State Part B: Knowledge Representation Construct a truth table for the following propositions: P=[(pq)r][(pr)(qr)]