a. Write Prolog clauses that define the predicate sorted (L), which is true if and only if list L is sorted in ascending order.

b. Write a Prolog definition for the predicate perm (L, M), which is true if and only if L is a permutation of M.

c. Define sort (L, M) (M is a sorted version of L) using perm and sorted.

d. Write a faster sorting algorithm, such as insertion sort or quick sort, in Prolog

Answer rating: 100% (QA)

a It is a program language in which basic form of First order logic FOL is used It is a natural lang... View the full answer