Discussion: Trees for DBMS and data mining
A. Define a B-tree of Order 2 and draw a B-tree example with sample records. Explain why B-trees are often used in relational DBMS.
B. Present the data structure and algorithm used in the ID3 inductive learning method.
C. Present a business problem that is suited for using ID3. Please explain the characteristics of your problem and the steps (for your business problem) involved to perform your knowledge discovery task.
The response should include a reference list. Double-space, using Times New Roman 12 pnt font, one-inch margins, and APA style of writing and citations.