Please implement this in OCaml language and without using list library methods.

Basically implement the list library's equivalent of merge but only using the standard library methods available.

merge lst1 lst2 - Type: 'a list 'a list 'a list - Description: Merge two sorted lists, 1 st1 and lst2, and return the result as a sorted list. - Examples: merge[1][2]=[1;2] merge [][]=[] merge [1;4][2;3]=[1;2;3;4] merge [1;4;5][2;3;6;7;8;9]=[1;2;3;4;5;6;7;8;9] merge [1][0]=[0;1]