Consider the following CFG S NP VP VP ? VP PP VP-V NP PP P NP NP ? DET N NP Laura NP ? soccer DET ? the N park V ? plays P?in (a) Design a lexicalized tree adjoining grammar (LTAG) that generates the same language as the CFG. There are multiple possible solutions to this problem. Each rule in your grammar should contain exactly one lexical anchor. Your grammar should contain at least one auxiliary tree. (b) Given your LTAG from part (a), what is the derivation tree for the sentence "Laura plays soccer in the park"? Consider the following CFG S NP VP VP ? VP PP VP-V NP PP P NP NP ? DET N NP Laura NP ? soccer DET ? the N park V ? plays P?in (a) Design a lexicalized tree adjoining grammar (LTAG) that generates the same language as the CFG. There are multiple possible solutions to this problem. Each rule in your grammar should contain exactly one lexical anchor. Your grammar should contain at least one auxiliary tree. (b) Given your LTAG from part (a), what is the derivation tree for the sentence "Laura plays soccer in the park