Hey everyone, can you help me to solve these two exercises thanks in advance 
Task 1: Some list exercises
Make use of the DCG listed below which is using extra arguments to construct the parse tree.
s(s(NpT,VpT)) → np(NpT), vp(VpT).
np(np(DetT,NT)) → det(DetT), n(NT).
np(np(PnT)) → pn(PnT).
vp(vp(ViT)) → vi(ViT).
vp(vp(VtT,NpT)) → vt(VtT), np(NpT).
%% Lexicon
det(det(a)) → [a].
det(det(the)) → [the].
n(n(bride)) → [bride].
n(n(nurse)) → [nurse].
n(n(yakuza)) → [yakuza].
n(n(whiskey)) → [whiskey].
pn(pn(bill)) → [bill].
pn(pn(gogo)) → [gogo].
vi(vi(whistles)) → [whistles].
vi(vi(fights)) → [fights].
vt(vt(drinks)) → [drinks].
vt(vt(kills)) → [kills].
Load it and type listing. You will see that Prolog translated the user friendly → notation to its
internal DCG format.
To find out whether a list of words is a sentence and to receive the corresponding parse tree P,
you have to ask s(P,WordList,). Try some queries and note their result. Maybe do a trace.
Task 2: Write a parser for your own DCG
If you haven’t done so already, do task 2 of day 3.
Then turn this DCG into a parser by adding an extra argument for constructing the parse tree, as we
have done for the English grammar in the lecture and as you can see in assignment 1.
a. Ask some queries (parse some sentences) and note their results.
b. Generate the first 5 sentences of your grammar and note the result.