Hi, I have draw the state space tree, and I have the correct answer to each question. Can you explain how to get the answer for question #2, #3,#4 in words (not just circle the correct nodes)? Thank you!

This pre-assignment quiz consists of ONE question with 5 parts. Construct a pruned state space tree for the case where n=4, the target weight W= 13 , and the weights of the nodes are: w1=3,w2=4,w3=5,w4=6 Now answer the following questions: The number of distinct solutions is The number of leaves in the pruned state space tree is The number of non-promising nodes in the pruned state space tree is The total number of nodes in the pruned state space tree is Is a state space tree a full binary tree? Type either YES or NO