Let x be a string of length n, and let y be a string of length n − k, for 1 ≤ k < n. we wish to line up the symbols in x with the symbols in y by adding k blanks to y. suppose that we add two separate blocks of blanks, one of size i and one of size k − i, for 1 ≤ i < k. how many ways are there to do this? ways

In all honesty, there really is no “work” per say to show. mainly it’s just using the process of elimination. the question is asking which domain(s) would be the most appropriate for the function c(n). n is the number of observed vehicles so right away, 1, 2, and 3 can be eliminated.why? 1, 2 start in the negatives and therefore it is impossible to observe negative cars. so, #4 would be the best answer to the given problem.

The answer is 16.66 i'm pretty sure

The answer to your question is 25hope this !