' AI '

Please I want to solve it with explanation for question 2 and 3.

1-

2-

3-

4-

MINMAX algorihtm is: optimal with an optimal opponent. complete with finite game tree. linear in time complexity. linear in space complexity Suppose for an instance [1,0.2,0.3] with label +1 a single perceptron with a weight vector [0.5,0.4,0.1] predicts the label - for this instance What is the new (i.e., updated) weight vector for this perceptron? [0.5,0.2,0.4][1.5,0.6,0.2][0.5,0.2,0.4][0.5,0.4,0.1] The sigmoid activation function bounds the value of the output nodes to be in the range: [0,1] [1,0] [1,1] [0.0,0.5] Anaysing customers beheviour and their purchsse transactions by grouping custoners acouding bo their attrbutes is inportant for markating decisians. This is an axample of regression takk. clustaeing task. dassification task: predicting task