Find the correct statement about distributed indexing.

Question $7$ options:

Terms can be partitioned whereas documents cannot be partitioned at all.

In the MapReduce architecture, Parser writes $($term$,$ docID$)$ into a certain number of partitions.

A master machine cannot break break up indexing into sets of tasks, however it can assign each task to an idle machine.

In the MapReduce architecture, Parsers collects all $($term$,$ docID$)$ pairs for one term$-$partition.