Question $1$: $(50$ pts$)$ Consider the Fractional Knapsack Problem.

$(25$ pts$)$ Design a greedy algorithm for Fractional Knapsack Problem that finds an optimum solution in $O(nlogn).$ Report the pseudocode of your algorithm.

$(25$ pts$)$ Implement your algorithm in Python. Randomly generate the inputs and report the console outputs. Report your Python code scripts.