Switzerland population is 8,455,804. Its GDP is 617 billion in local currency, the Swiss Franc which is worth $1.10(or 1 U.S. dollar is 0.91 Swiss Franc). Calculate Switzerland GDP in U.S. Dollar. What is GDP per capita in U.S. Dollar? In your opinion and in comparison to other countries, what does this GDP per capita indicate? Show all work.

Switzerland population is 8,455,804. Its GDP is 617 billion in local currency, the Swiss Franc which is worth $1.10(or 1 U.S. dollar is 0.91 Swiss Franc). Calculate Switzerland GDP in U.S. Dollar. What is GDP per capita in U.S. Dollar? In your opinion and in comparison to other countries, what does this GDP per capita indicate? Show all work.

During the time of a pandemic and the existence of a highly contagious corona-virus, many scientists recommended wearing a mask. Les us assume that wearing a mask can limit the spread of the virus. Is wearing a mask an externality? Positive or negative? How about not wearing a mask? Explain your answers.

During the time of a pandemic and the existence of a highly contagious corona-virus, many scientists recommended wearing a mask. Les us assume that wearing a mask can limit the spread of the virus. Is wearing a mask an externality? Positive or negative? How about not wearing a mask? Explain your answers.

Assume in a given month, Japan’s export to the U.S. increased. How such an increase will affect the Japanese Yen? From a U.S. perspective, how this increase will affect the U.S. dollar? Knowing that both currencies can float, verbally explain your answers using the demand supply model( no need to draw a graph)

Assume in a given month, Japan’s export to the U.S. increased. How such an increase will affect the Japanese Yen? From a U.S. perspective, how this increase will affect the U.S. dollar? Knowing that both currencies can float, verbally explain your answers using the demand supply model( no need to draw a graph)

Give a greedy algorithm for Binary Knapsack that runs in O(n log n) time, where n is the number of items to consider, and achieves at least half the maximum profit when all the items have the same profit-to-weight ratio. Explain why your algorithm achieves this

Give a greedy algorithm for Binary Knapsack that runs in O(n log n) time, where n is the number of
items to consider, and achieves at least half the maximum profit when all the items have the same
profit-to-weight ratio. Explain why your algorithm achieves this