Hello, I would like to solve this question using the C language with details today, please

1) Write a program that creates and manages Fibonacci heaps. The program must implement the following operations: creation, insertion, find min, extract min, decrease key, and deletion. The program should present a menu where user may choose from implemented options.

min[H] min[H] 7 18 38 23 -. 7 - 21 17 24 17 24 23 21 39 41 ( 52 38 30 26 26 46 30 52 39 41 35 35 After extract min Decreasekey(52, 1) Delete 24