Please write a OCaml languaged code that can do this. I understand how to do this for just an int or float as init, but how does it do it along with a string as init? The program should be recursive.

- Description: MaxProcChain from Project 1a makes its return, OCaml style! This function takes in an initial value and a list of functions, and decides to either apply each function or not to maximize the final return value. For example, if I have a list of functions: funcc] and an initial value x, then I take the maximum value of - Type: 'a ('a 'a) list 'a - Examples: maxFuncChain 2[( fun xx+6)]=8 maxFuncChain2[( fun xx+4); (fun xx4)]=24 maxFuncChain4[( fun xx2);( fun xx+10)]=14 maxFuncChain[( fun xx1); (fun xx500);( fun xx+1)]=501 maxFuncChain "hello" [( fun xx"1"); (fun xx"2");(funxx"3")]=" "hello3