I need the answer to the following questions:.

Optimistic:

e(v₄)=

e(v₄)=

Keep/prune?

e(v₁)=

e(v₁)=

Keep/prune?

e(v₂)=

e(v₂)=

Keep/prune?

Pessimistic:

e(v₄)=

e(v₄)=

Keep/prune?

e(v₁)=

e(v₁)=

Keep/prune?

e(v₂)=

e(v₂)=

Keep/prune?

Please show steps as well

Consider the decision tree below where C1, C2, C3 are class labels. Determine whether the tree needs pruning using generation errors. If yes, prune it. You do this in two cases: (a) optimistic and (b) pessimistic. Write down all your calculation and draw the final tree if there is any change. For the convenience of reference, the nodes are labelled by vi, V2, ..., V8 v0- C1:20; C2: 10; C3: 5 V3 C1:9 C2: 1 C1:1 C1:9 C2: 1 C3: 1 C3: 3 V5= C1:1 C2: 2 C3: 1 C1:0 C2:6 C3:0 Consider the decision tree below where C1, C2, C3 are class labels. Determine whether the tree needs pruning using generation errors. If yes, prune it. You do this in two cases: (a) optimistic and (b) pessimistic. Write down all your calculation and draw the final tree if there is any change. For the convenience of reference, the nodes are labelled by vi, V2, ..., V8 v0- C1:20; C2: 10; C3: 5 V3 C1:9 C2: 1 C1:1 C1:9 C2: 1 C3: 1 C3: 3 V5= C1:1 C2: 2 C3: 1 C1:0 C2:6 C3:0