Suppose that instead of always selecting the first activity to finish, we instead select the last activity to start that is compatible with all previously selected activities. Describe how this approach is a greedy algorithm, and prove that it yields

The report starts with a brief motivation of resource allocation problem in wireless networks. Then, some of the prior related work on the subject are mentioned. Finally, it provides the details instructions on MATLAB functions used in the algorith