Copyright © T. H. Merrett COMP 612 Principles of Database Programming Week 7 Assignment 6 a) (40/50) Use relational recursion to find the longest path in Lewis Carroll's knowledge base. (You will thus show for this case that no heavy fish is unkind to children, but your code should be able to discover the longest path in any such data.) You can input "/course/cs612/lewis/createLewisdb.a"; to load the database. ALL RELIX ASSIGNMENTS ARE TO BE SUBMITTED IN THE FORM OF AN UNEDITED TRACE OF YOUR DEBUGGED FINAL RUN. b) (10/50) (You do not need to run this part on relix.) Design a relation which can be used to represent text as a heirarchy (e.g., as a sequence of chapters, which are sequences of sections, which are sequences of paragraphs, which are sequences of sentences, etc.). Use as few attributes as possible, but be prepared to answer the following question. Shared marks for shared work: assignments should be your own work; marks for joint assignments will be divided by the number of collaborators. But please feel free to work in groups to learn or for extra work that is not for marks. HINT: treat your own work for marks as top secret; treat others' work, if you come across it, as personal and private to them.