Question 6 [11] The way in which cryptarithmetic puzzles can be solved in Prolog is discussed in section 4.4 of Bratko. Use the guidelines given by...

Question 6 [11] The way in which cryptarithmetic puzzles can be solved in Prolog is discussed in section 4.4 of Bratko. Use the guidelines given by Bratko to solve the following puzzle: CROSS + ROADS = DANGER.

Question 7 [10] The Russian Multiplication problem can be defined as follows: Say you want to multiply x with y giving z. The problem is solved using the following iterative loop: With each iteration, x gets the value x/2 and y gets the value y*2. If x is even, the y-entry is ignored. If x is odd, y is added to a running total. The loop terminates when x = 0. For example: Calculate z = 24 * 52.

x y Calculation of total (T) Total 24 52 0 12 104 0 6 208 0 3 416 T = T + 416 416 1 832 T = T + 832 1248 0 1248 Write a Prolog program to implement the Russian Multiplication Problem