Implement A* graph search. A* takes a heuristic function as an argument. Heuristics take two arguments: a state in the search problem (the main argument), and the
problem itself (for reference information).
Note that you may need to change data structures like priority queue depending on
your implementation. For example, if the priority queue is a queue of custom class
objects, you might need to change the update function. However, it is not required
that you implement the algorithm this way.
b) Comment on Admissibility vs. Consistency.

Raveena is making a professional presentation for a newly launched product of her company. she wants to incorporate the following features in her presentation. a) to add serial numbers in each slide b) to add name of her company on top of each slide. c) to add the picture of her product on the second slide(the picture of her product is stored on her computer) write the commands/features of her presentation tool using which she can perform the above operations.

Write a program that defines symbolic names for several string literals (chars between quotes). * use each symbolic name in a variable definition. * use of symbolic to compose the assembly code instruction set can perform vara = (vara - varb) + (varc - vard); ensure that variable is in unsigned integer data type. * you should also further enhance your symbolic logic block to to perform expression by introducing addition substitution rule. vara = (vara+varb) - (varc+vard). required: debug the disassembly code and note down the address and memory information.

The head restraint should be adjusted so that it reaches a.the top of your ears b.the base of your skull c.the top of the head