Consider the following input text that contains part of a poem called The Love Song of J. Alfred Prufrock BY T. S. ELIOT:

Time for you and time for me, And time yet for a hundred indecisions, And for a hundred visions and revisions, Before the taking of a toast and tea.

Lets say we want a word count of this file by creating a MapReduce application. We would split this file into the following four input pairs to four Mapper tasks to consume.

(0, "time for you and time for me") (1, "and time yet for a hundred indecisions ") (2, "and for a hundred visions and revisions") (3, "before the taking of a toast and tea")

What will the input pairs look like for the Reducer tasks? Assume that combiner tasks are used in the MapReduce application.