Given the following decision tree derived from the raisin classification dataset, derive if-then rules from this tree and code them as Prolog rules. The Prolog code must take the attribute values as input and classify the raisin type. The details of the dataset along with the variable details if required is available in the announcement section. MajorAxisLength

Evaluations will be based on the following.

1. Use Min-Max algorithm and implement the game in PYTHON (35% marks)

2. Derive the rules from the given decision tree and code as Prolog rules. (35% marks)

3. Interactive implementation. Dynamic inputs-based run of the game with step wise board display and error free game ending. (15% marks)

4. Interactive implementation. Dynamic inputs-based run of the logic expert system with step wise options display and error free recommendation & ending. (15% marks)

MajorAxisLength 1006.375 1 | Extent 0.666255 : Kecimen (4.0) 1|||| Extent >0.701678 : Besni (6.0) | | | | incArea > 62835: Kecimen (124.0/24.0) | | | Perimeter >1122.831 | | | | Extent 0.671309 | | | | Eccentricity 0.75951:Kecimen(9.0/1.0) I I Extent >0.7476: Kecimen (27.0) MajorAxisLength > 422.279133: Besni (410.0/41.0)