Solve the following problem using Best First Search Technique.Compute one forward pass through the below network and compute the output. Assume the

activations in all nodes are linear i$.$e$.,y=x,$ and bias of all nodes are zero.

Also, deduce the expressions to update the weight between the node il and hl$,$ using Gradient

Descent, assuming the expected output $=75$ and error as the standard square error i$.$e$.,$ Error $=$

$($ExpectedOutput $-$ ActualOutput$){?}^2$