(a) (10 points) In deep priority search algorithm, let T be the result tree. Not included in t for each arc (m; n), ancestor of m, node n, or n, ancestor of node m show that. With a counter example, show that the broad priority search tree does not have this feature. (b) (10 points) The path from the source node to other nodes, e.g. j, is with a broad priority. Show that it is the shortest path in the search tree. (a) (10 points) In deep priority search algorithm, let T be the result tree. Not included in t for each arc (m; n), ancestor of m, node n, or n, ancestor of node m show that. With a counter example, show that the broad priority search tree does not have this feature. (b) (10 points) The path from the source node to other nodes, e.g. j, is with a broad priority. Show that it is the shortest path in the search tree