In Ocaml A priority queue is a data structure where each element has a priority assigned to it and elements are dequeued according to their priority.

Design a type in OCaml that implements this data type with functions to insert an element with given priority in the priority queue, remove and return the element with the smallest priority, and check to see if the priority queue is empty.

NOTE: Watch carefully about using generative AIs tools to help you with this as the solution they suggest uses mutable data types. Think about how to design the solution to this problem in such way that the mutable state $($think$...$ heaps$)$ is hidden behind a functional facade.