Please code this method in OCaml and without using list library methods. This code should only be implemented using the standard library. Thank you. jumping$\_$tuples lst$1$ lst$2-$ Type: $(($ a $*\text{'}$b$)$ list $->(\text{'}$ c $*\text{'}$a$)$ list $->\text{'}\text{'}$ list $-$ Description: Given two lists of two element tuples, $1$ st$1$ and lst$2,$ returns a list with the first element of every odd indexed tuple in $1$st$1,$ and the second element of every even indexed tuple in $1$st$2,$ interwoven together $($starting from index $0).$ For this function, consider $0$ as even. If the lists are not the same length, the resulting list should have the length of the shorter of the input lists. $-$ Examples: jumping$\_$tuples $[(1,2)$ ;$(3,4)$ ;$(5,6)][(7,8)$ ;$(9,10)$ ;$(11,12)]=[8$ ; $3$ ; $12]$ jumping$\_$tuples $[($ true, $"$a$")$; $($false$,"$b$"))][(100,$ false $)]=[$ false $]$ jumping$\_$tuples $[($ "first", "second"$)$; $("$third$",$ "fourth"$)][($ "fifth", "sixth"$)$; $("$seventh$",$ "eighth"$)]=[$ "sixth"; "third" $]$ jumping$\_$tuples $[][]=[]$