Page: 1 of 1 Words: 0 Given the following expected returns and standard deviations of assets B. M. Q and D, which asset should the risk-averse manager select? Asset B Expected Return 10% 16% 14% 12% Standard Deviation 5% 10% 9% 8% 00000 Asset B because it has the lowest expected return. Asset B because it has the lowest standard deviation. Asset M because it has the highest expected return. Asset M because it hsa the highest standard deviation. OA risk-averse manager would not invest among the four assets in this category Calculate the expected value of return and the standard deviation for Asset A. Choose both the correct answers among the given choices. Possible Outcomes Asset A Probability Pessimistic Most likely 0.25 0.45 0.30 Optimistic The expected value of return is 12% The expected value of return is 4% The expected value of return is 12.7% The expected value of return is 2.3% The standard deviation is 125 The standard deviation is 4% The standard deviation is 12-7 The standard deviation is 2,3% Returns (%) 10 12 16 Card Trading Anthony and Cora are playing Dominion, their favorite card game. In Dominion, there are T different card types, and each player has a set of cards (known as a deck). A deck D is said to have C combos if C is the largest integer such that for C different card types in the game, D contains at least two cards of that type. Anthony currently has N cards and he wants to trade cards with Cora such that he'll have a deck with exactly K combos. For each card type i (1 There are in trading posts numbered 1 to n as you travel downstream. At any trading post i you can rent a canoe to be returned at any of the downstream trading posts j>i. You are given a cost array R(i,j) giving the cost of these rentals for all sixjsn. We can assume that R(ii)=0, and that you can't go upriver (so perhaps R(i,j) == if i>). For example, one cost array with n=4 might be the following. toj Cost 1 2 3 4 1 0 2 3 7 2 2 4 - from i 3 4 0 2 0 The problem is to find a dynamic programming algorithm that computes the cheapest sequence of rental taking you from post 1 all the way down to post n. In this example, the cheapest way is to rent canoes from post 1 to post 3, and then from post 3 to post 4 for a total cost of 5. The second problem is to find the least cost associated with this sequence. You are to design a dynamic programming algorithm for both the problems. Describe the table and what does each entry in the table mean? How will the table be initialized? In which order the table will be filled? What is the recurrence? How will you use the table to find what is cheapest sequence of canoe rental (for the first problem) and the least cost of the canoe rentals (for the second problem)? Give the asymptotic complexity of the algorithms. Implement the your algorithm by using C Input: The input consists of n+1 lines: the first line will be a single integer that indicates the number of trade posts. The next in lines will give the rental costs that taking post i to j (where isj). For example, the input of the above given example would be: 4 0237 024 02 0 Output: Output the minimum cost to travel from post 1 to post n. Output the sequence of canoe renting that achieves the goal. For example, the sample output of the above given example would be: The minimum cost is 5 The renting sequence is 1->3->4 I have an algorithm to find the minimum cost. How could I go about printing the renting sequence?