Assume that we are given an integer (as a start) and we can proceed by applying any of the following two actions: Action1 (x) = 3X-6 and Action2 (x) = (x mod 3) +4x trying to reach an integer goal. Let the initial integer be 4: a) Draw the first 3 levels of the search tree. (Remark: root is at level Zero) b) Write the sequence of integers visited during breadth-first-search on your search tree. c) Write the sequence of integers visited during depth-first-search on your search tree. d) Write the sequence of integers visited during IDDFS on your search tree. e) Assume the cost of action 1 is 4 and of action 2 is 1. Write the sequence of integers visited during Uniform Cost Algorithm on your whole search tree of part a