Use SWI Prolog to write the following programs . Make sure the output from your programs looks just like the sample output in the problems. Please comment the code. I will upvote clear answer, thank you! This is a prolog Logic programming assignment. Make sure your solution code is in prolog.

Thanks

1. To get warmed up, write a function, hlbackwards, that takes a list as input, and returns a list in which the elements of the toplevel list are in reverse order. Here is a sample execution: 2- h!backwards ( [a, b, [c, d], e] , X). X-e, [c, d], b, a] Yes 2. To continue warming up, write a function, 11backwards, that takes a list as input, and returns a list in which every list and sublist is in reverse order. Here is a sample program execution: 2-11backwards ( [a, [b, c], [ [a, e, [f] , g] , h, ?] ] , X) . x-[i, h, [g, [fl, e, d],c, bl, a] Yes 1. To get warmed up, write a function, hlbackwards, that takes a list as input, and returns a list in which the elements of the toplevel list are in reverse order. Here is a sample execution: 2- h!backwards ( [a, b, [c, d], e] , X). X-e, [c, d], b, a] Yes 2. To continue warming up, write a function, 11backwards, that takes a list as input, and returns a list in which every list and sublist is in reverse order. Here is a sample program execution: 2-11backwards ( [a, [b, c], [ [a, e, [f] , g] , h, ?] ] , X) . x-[i, h, [g, [fl, e, d],c, bl, a] Yes