Use a disfluent question or a proper question and find the answer to the question based on the given context or return None if an answer can't be found. A disfluent question is a question that has some interruptions in it while framing. A proper question is the correct form of the question without any disfluency.
Example: proper question: In what year did the U of C become one of 7 founding members of the Association of Chicago Universities? 
 disfluent question: In what year did Robert Harper or did the U of C become one of 7 founding members of the Association of Chicago Universities? 
 context: Founded by the American Baptist Education Society with a donation from oil magnate and wealthiest man in history John D. Rockefeller, the University of Chicago was incorporated in 1890; William Rainey Harper became the university's first president in 1891, and the first classes were held in 1892. Both Harper and future president Robert Maynard Hutchins advocated for Chicago's curriculum to be based upon theoretical and perennial issues rather than on applied sciences and commercial utility. With Harper's vision in mind, the University of Chicago also became one of the 14 founding members of the Association of American Universities, an international organization of leading research universities, in 1900.
Example solution: None
Example explanation: The answer to the above question is not found from the context hence it is not answerable so the output is 'None' so it is a positive example.

Problem: proper question: What must the integer m be greater than or equal to when performing trial division? 
 disfluent question: When do you performing trial division I mean what must the integer m be greater than or equal to in this equation? 
 context: The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prime. Indeed, if  is composite (with a and b ≠ 1) then one of the factors a or b is necessarily at most . For example, for , the trial divisions are by m = 2, 3, 4, 5, and 6. None of these numbers divides 37, so 37 is prime. This routine can be implemented more efficiently if a complete list of primes up to  is known—then trial divisions need to be checked only for those m that are prime. For example, to check the primality of 37, only three divisions are necessary (m = 2, 3, and 5), given that 4 and 6 are composite.

Solution: None