Need help with this assignment for my artificial intelligence class!

Question 2: Living in Another World Imagine a world that is much more exciting than the one with the three toy blocks. This world consists of four beer bottles A, B, C, and D. They can be arranged in any order from left to right except that bottle A can never be further to the right than bottle D. For example, ABCD, CBAD and CADB are possible states of our world, whereas DCBA, CDAB, or BCDA can never occur. The world can be manipulated by the schema swap (x, y), which swaps the bottle in positions x and y. For example, swap1, 2) turns state BCAD into CBAD. However, swap (1, 2), swap (2, 3), and swap (2, 4) are the only three available operators. 1) Draw the state-space graph of this world. You do not need to draw any bottle; just use four letter sequences to describe states. Assume that your world is in the state ADBC, but you would like it to be in state CBAD. Use best-first search to find a solution that requires a minimum number of operations. To do this, first define your estimation function f(n)-g'(n) h'(n). Then write down the resulting search tree, indicate the order in which nodes were created, and for each node n give the value of f'(n) 2)