In the state space search method called as ________ , all children of the E-Node are generated before any other live node can become the E-node.

Dynamic Programming approach can be used when 

A building has n floors, two lifts, and 2 stairs.

• Lift L1 operates only up to floor

  k

• Lift L2 operates up to floor

  n

• Stairs connect all floors

A student wants to reach the target floor t from the ground floor.Analyze the time complexity of your algorithm when we have n floors

Let A1,A2,A3,A4 be  four matrices with dimensions:

A1:10*100

A2:100*5

A3:5*50

A4:50*1

What is the minimum number of scalar multiplications needed to compute the matrix product A1,A2,A3,A4using Matrix Chain Multiplication?