Two replicas store a document title. During a partition, replica A confirms a change from ‘Draft’ to ‘Final’. A later read reaches replica B, which still knows only ‘Draft’. With no further writes, can B guarantee both a linearizable read and completion while the partition lasts indefinitely? Explain why returning an error or syncing later does not provide both guarantees.