Write a program in PROLOG to implement merge (L1, L2, L3) where L1 is first ordered list and L2 is second ordered list and L3 represents the merged list.

23.Write a program in PROLOG to implement merge (L1, L2, L3) where L1 is first ordered list and L2 is second ordered list and L3 represents the merged list.

%PROLOG to implement merge (L1, L2, L3)

%  below merge function is not predefined you can use any name as function

merge([],[],[]).

merge([],L2,L2).

merge(L1,[],L1).

merge([H1|T1],[H2|T2],[H1|T3]):- H1=<H2,

merge(T1, [H2|T2], T3).

merge([H1|T1],[H2|T2],[H2|T3]):- merge([H1|T1], T2, T3).

% Output