// Return the number of ways that all n2 elements of a2 appear
// in the n1 element array a1 in the same order (though not
// necessarily consecutively). The empty sequence appears in a
// sequence of length n1 in 1 way, even if n1 is 0.
// For example, if a1 is the 7 element array
// 10 50 40 20 50 40 30
// then for this value of a2 the function must return
// 10 20 40 1
// 10 40 30 2
// 20 10 40 0
// 50 40 30 3
int countIncludes(const double a1[], int n1, const double a2[], int n2)
{
return -999; // This is incorrect.
}