Using GNU Prolog please.

4 In this problem, you need to reimplement a predicate to flatten a nested list structure. You need to transform a list, possibly holding lists as elements into a 'flat' list by replacing each list with its elements (recursively). Hint: You can use the predicates is_list/1 to check if an element is a list and append/3 to append the flattened lists. You can use cut (!) for control flow between rules. [10 points] Test case: |?-my_flatten ([a,[b,[c,d],e]],X). X=[a,b,c,d,e] In this problem, you need to reimplement the Insertion Sort algorithm. In this algorithm, the first element is removed from the list, and remaining list is recursively sorted. Then the first element is inserted preserving the sorted order of the list. Hint: You can represent the input list as: [First | Tail]. You should implement a separate insert predicate to insert First in the sorted Tail. You must write comments to indicate the size-n problem, stopping condition and its return value, size m-problems, and construction of the size-n problem from size-m problems. [10 points] Test case: | ?- isort([ [8,3,4,12,25,4,6,1,9,22,6], Sorted). It returns: Sorted =[1,3,4,4,6,6,8,9,12,22,25]