Need help with this assignment. Hit a brick wall pretty early on. We have access to a couple of classes which I've embedded screens of below. Trying to implement A* with Manhattan Distance hueristic to solve a sliding tile 8puzzle. Were given classes that generate 8puzzles and perform a number of different operations on them. /** * For this assignment, you will need the puzzle.jar file and its documentation (docs.zip) * from homework 4, and the Examples.java will be useful as well. * * In Java, implement any search algorithm that we saw in class to solve sliding tile * puzzles, such as the 8 puzzle, 15 puzzle, etc. * * You must not change the name, parameters, or return type of the solver method. * You are free to add as many helper methods as you find useful. * * You are free to use the MinHeapPQ class that is in the puzzle.jar (see its documentation). * It supports changing the priority of elements that are in the PQ, whereas the PQ implementation * in the Java API does not support that operation. * * Grading: * Your grade will be in the interval [0, 100] if you implement an algorithm that is guaranteed * to find the optimal path. Otherwise, if you implement an algorithm that is not * guaranteed to find the optimal path (e.g., DFS), then your grade will be in the interval [0, 85] * (i.e., you lose 15 points for the non-optimal algorithms). * * If your code doesn't compile, then your grade will be in the interval [0, 60] depending upon the severity * of the syntax errors. i.e., make sure your code compiles (you lose at least 40 points if it doesn't. * * After completing the solver method, write code to demonstrate that it works in the Homework5Main class. * * @author Your Name Goes here. * */ public class Homework5 { /** * Solves sliding tile puzzles with the algorithm of your choice. * * @return A path from the start state to the goal state. */ public ArrayList solver(SlidingTilePuzzle start) { // this return here temporarily so this compiles. return null; } }

Class MinHeapPO E Conarrueror Summary MinHcapro0 Method Summay Inctance Mothods Concroto Mathods st bonlea Mo an e mont to the pr om queue pronted citer:) t e Minue pPQ coesnt cotam mother tdentieal c ement, ori ) t e Min JcapFU does oom 2 m identical e ement. but the ne one as o er pat tty vahe peek() esesses the top t the MinicpEQ Aecasins nd cuens the priorty value ol the top at the intHeupP polli Methods inherited from class java.lang Object Constructor Dczal MiaHeapPO Mcchod Buvwmary in Gts beslutia .ch Methods Inhertted trom class Javalangotject Consnueor Sumury fdnohod Sumvwary Methods inherited from claas jova.lang.objoct Consucror Dera Consruenor Suwary Mwchod Savomary n distarca htt Sohu an ranseet,:didn' T ile ,.staJe zrng A' S.Eth tai" thehenne mnberor tiuplex: tlex. Consrucror Deraw Class MinHeapPO E Conarrueror Summary MinHcapro0 Method Summay Inctance Mothods Concroto Mathods st bonlea Mo an e mont to the pr om queue pronted citer:) t e Minue pPQ coesnt cotam mother tdentieal c ement, ori ) t e Min JcapFU does oom 2 m identical e ement. but the ne one as o er pat tty vahe peek() esesses the top t the MinicpEQ Aecasins nd cuens the priorty value ol the top at the intHeupP polli Methods inherited from class java.lang Object Constructor Dczal MiaHeapPO Mcchod Buvwmary in Gts beslutia .ch Methods Inhertted trom class Javalangotject Consnueor Sumury fdnohod Sumvwary Methods inherited from claas jova.lang.objoct Consucror Dera Consruenor Suwary Mwchod Savomary n distarca htt Sohu an ranseet,:didn' T ile ,.staJe zrng A' S.Eth tai" thehenne mnberor tiuplex: tlex. Consrucror Deraw