Name the node which can’t be expanded further in state space tree of backtracking method.a.Dead nodeb.State Nodec.Live noded.E-Node

Name the node which has been generated but none of its children nodes have been generated in state space tree of backtracking method.a.Live nodeb.State Nodec.Dead noded.E-node

In a BST, if a node has no children, it is known as a ______.root nodeleaf nodeinternal nodesubnode

Breadth first search __________a.Scans each incident node along with its children.b. Is same as backtrackingc.Scans all incident edges before moving to other NODE.d.Scans all the nodes in random order.

Using the tree shown below. (The numbers on the arcs are the arc lengths).  Assume that the nodes are expanded in alphabetical order when no other order is specified by the search, and that the goal is state G. No visited or expanded lists are used. What order would the states be expanded by the Depth First?(NB: Do not put spaces in your solution!)2 pointsYour answer

n a BST, if a node has no children, it is known as a ______.