Please help asap with code written in OCaml functional language!!!

The following pattern of numbers is called "Pascal's triangle": 111121133114641 The numbers at the edges of the triangle are all 1 , and each number inside the triangle is the sum of the two numbers above it to the left and right. Write a function called pascal_coefficient which takes two int arguments (corresponding to the row number (starting from 1) and the index inside the row (also starting from 1)) and computes elements of Pascal's triangle by means of a recursive process. Use pattern matching to make the code cleaner. This is not optional! Use of if/then/else in your solution will result in lost marks. For arguments that don't correspond to locations in Pascal's triangle (like numbers