NEED help on question 2

An edited book has 6 articles. The table shows the lengths of the articles and their importance where the scale of importance is 1(low) to 10(high). The book must be at most 150 pages long The problem is to edit the book so that the overall importance is maximized. 1. [20] Edit the book by choosing articles whose pages and importance are given in the table. i.e Give Calculating the fractional weightage of each article w = pages * importance A. 3x15=45 B. 5x20=100 C. 4x10=40 D. 3x30 90 E. 4x60=240 F. 4x60 240 A. [8] the list of the chosen articles with their chosen number of pages in the order a. f-e-b-d-a-c (order) [6] the importance for each chosen article and B. a. the importance for each chosen article is shown in the above table [6] the total maximum importance of the edited book. C. a. 240 ance of article es 15 10 30 4 4 40 2. [10] Consider a greedy rule for the above Fractional Knapsack Problem that selects the articles in non-decreasing order of pages. If the capacity of the knapsack is not exceeded, we take all of the pages. Otherwise, we take whatever portion of the article fills the knapsack and stop. Give an example to show that this greedy algorithm does not necessarily maximize the importance An edited book has 6 articles. The table shows the lengths of the articles and their importance where the scale of importance is 1(low) to 10(high). The book must be at most 150 pages long The problem is to edit the book so that the overall importance is maximized. 1. [20] Edit the book by choosing articles whose pages and importance are given in the table. i.e Give Calculating the fractional weightage of each article w = pages * importance A. 3x15=45 B. 5x20=100 C. 4x10=40 D. 3x30 90 E. 4x60=240 F. 4x60 240 A. [8] the list of the chosen articles with their chosen number of pages in the order a. f-e-b-d-a-c (order) [6] the importance for each chosen article and B. a. the importance for each chosen article is shown in the above table [6] the total maximum importance of the edited book. C. a. 240 ance of article es 15 10 30 4 4 40 2. [10] Consider a greedy rule for the above Fractional Knapsack Problem that selects the articles in non-decreasing order of pages. If the capacity of the knapsack is not exceeded, we take all of the pages. Otherwise, we take whatever portion of the article fills the knapsack and stop. Give an example to show that this greedy algorithm does not necessarily maximize the importance