Apply the CKY algorithm to parse the sentence and come up with a parse tree. Show all steps involved (the major step is in building the matrix / table used in CKY algorithm). In case there are two parse trees, draw / output both parse trees Q 4 A. Write a short note on the following: a. Shift-reduce parser b. SHIFT operation c. LEFT ARC operation d. RIGHT ARC operation Q 4 B. Consider a sentence - "book me the morning flight" that needs to be dependency parsed to generate the following dependencies: book me, flight morning, flight the, book flight, root book. Show the step by step trace of dependency parsing (recollect the stack trace explained in class). At each step, mention the contents of the stack, the word list (input buffer), the action performed (SHIFT / LEFT ARC / RIGHT ARC) and relation added (if a relation was added at that step)