C code please!

You need to maximize the value to weight ratio.

Please provide with the input and output as shown in the image only.

Please provide correct and working code, If the code works I will upvote for sure. Or else I will downvote. Thank You...

Write a C program to solve the fractional knapsack problem. For example, the weights and values of 3 divisible items are given in the table below. The capacity of the knapsack bag is 50. Find an optimal solution to maximize the value to weight ratio. Item Weight Value 1 10 $60 12. 20 $100 3 0 $120 Note: Read knapsack capacity, number of items, weights of items and profits of items from the user. Print the solution. Round the solution to one fractional digit after decimal point. For example the solution for the above problem would be 1.0 1.0 0.7 For example: Input Result 50 1.0 1.0 0.7 3 10 20 30 60 100 120