ANSWER NEEDED IN THE NEXT HALF HOUR PLEASE.

SERIOUSLY.

Please answer the following question using mathematica:

#6. >1, "b"->2, etc. For example, to search for my name "David" I would look for the first occurrence of the pattern 4 1 22 94 (so the digits (4,1,2,2,9,4]). This function should have two arguments: the first gives the pattern, and the second tells how far in r to look. For example, your syntax should look like lookInPi[t4, 1, 2, 2, 9,4), 1000 000] (*Looks for my name in the first 1 Million digits of Pi*) mework.nb Given an arbitrary pattern, is it guaranteed that this function will return a result if allowed access to an arbitrary number of digits of n? #6. >1, "b"->2, etc. For example, to search for my name "David" I would look for the first occurrence of the pattern 4 1 22 94 (so the digits (4,1,2,2,9,4]). This function should have two arguments: the first gives the pattern, and the second tells how far in r to look. For example, your syntax should look like lookInPi[t4, 1, 2, 2, 9,4), 1000 000] (*Looks for my name in the first 1 Million digits of Pi*) mework.nb Given an arbitrary pattern, is it guaranteed that this function will return a result if allowed access to an arbitrary number of digits of n