What is cardinality in the context of database design, and how does it influence the relationship between tables?

RequirementsSolve the Tower of Hanoi (with five disks) using state space search algorithms implemented in Python.Two state space search algorithms: (1) a blind search (depth-first search with depth limit)  (2) a heuristic (A*) search algorithms must be included.  Solvinging this problem consists of two steps as listed below. Step 1 Problem Analysis and Design Before writing the python code, perform an analysis in order to determine the best design to solve the problem. This includes(1) The representation of the state(2) The representation of the state space(3) The design of the heuristic evaluation function in the A* algorithmThe problem analysis and design should be documented in the analysis and design document. Step 2 CodingWrite the Python program to implement the design created in Step 1The program must implement both Depth-First Search and A* Search algorithms. When running theprogram, it should output(1) The state space with each unsafe state marked and made a dead end.(2) The…

#12

Q2) Design a minimum state HLSM that manages access to a road that is under construction. Maximum 10 cars can pass in any one direction at a time, when there are cars waiting on the other side. • The system starts in the IDLE state • CARS LEFT =1 if there are cars on the left side waiting to pass • CARS_RIGHT = 1 if there are cars on the right side waiting to pass • If cars arrive simultaneously on the left and on the right at the same time, the cars on the right go first. • Only one car is allowed on the road at a time. • If 10 cars have passed in one direction and there are no cars waiting on the other side, direction shouldn't be changed until a car arrives on the other side. (a) Draw the HLSM to represent the above system. (b) Draw the circuit representing the data-path of this system. (c) Draw the control unit and connect it to the data-path with correct labeling.