If you don’t know enough about OCAML, please don’t bid, this problem is simple for people with knowledge in OCAML.

If you don’t know enough about OCAML, please don’t bid, this problem is simple for people with knowledge in OCAML.

I need a Ocaml program that implements a LIFO Stack, the stack saves only one ID (positive integer), the idea is to Push id’s on the stack, remove id’s from the stack and in the end the tests must pass accordingly to the right order.

I will provide a code already started with all the explanations needed for you to complete, please provide also some explanation or comments in the code, so I can understand it.You have to implement 3 functions: build test and print and also implement the tests, everything is explained in the code attached.Again if you don’t feel confident, don’t bid! Program needs to compile and run with all the simple requirements!