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. 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.01.00.7 For example