In this task, you are given a passage and a question regarding that passage. You must determine whether or not the question is answerable from the given passage. If a question is answerable, output should be 'True', otherwise 'False'. You must not consider any other information that is not provided in the passage while labelling True or False.

Q: Passage: In economics, notable Nobel Memorial Prize in Economic Sciences winners Milton Friedman, a major advisor to Republican U.S. President Ronald Reagan and Conservative British Prime Minister Margaret Thatcher, George Stigler, Nobel laureate and proponent of regulatory capture theory, Gary Becker, an important contributor to the family economics branch of economics, Herbert A. Simon, responsible for the modern interpretation of the concept of organizational decision-making, Paul Samuelson, the first American to win the Nobel Memorial Prize in Economic Sciences, and Eugene Fama, known for his work on portfolio theory, asset pricing and stock market behaviour, are all graduates. American economist, social theorist, political philosopher, and author Thomas Sowell is also an alumnus. Question: Who is known for working on portfolio capture theory?

A: False
****
Q: Passage: The interpretation of Islam promoted by this funding was the strict, conservative Saudi-based Wahhabism or Salafism. In its harshest form it preached that Muslims should not only "always oppose" infidels "in every way," but "hate them for their religion ... for Allah's sake," that democracy "is responsible for all the horrible wars of the 20th century," that Shia and other non-Wahhabi Muslims were infidels, etc. While this effort has by no means converted all, or even most Muslims to the Wahhabist interpretation of Islam, it has done much to overwhelm more moderate local interpretations, and has set the Saudi-interpretation of Islam as the "gold standard" of religion in minds of some or many Muslims. Question: Salafism posits that democracy is responsible for what type of horrible events of the 21st century?

A: False
****
Q: Passage: To measure the difficulty of solving a computational problem, one may wish to see how much time the best algorithm requires to solve the problem. However, the running time may, in general, depend on the instance. In particular, larger instances will require more time to solve. Thus the time required to solve a problem (or the space required, or any measure of complexity) is calculated as a function of the size of the instance. This is usually taken to be the size of the input in bits. Complexity theory is interested in how algorithms scale with an increase in the input size. For instance, in the problem of finding whether a graph is connected, how much more time does it take to solve a problem for a graph with 2n vertices compared to the time taken for a graph with n vertices? Question: How is the time needed to obtain the question to a problem calculated?

A:
False
****