Which of the following is true about Random One$-$Time Pad Ciphers?

Group of answer choices

They are only breakable if common words $($e$.$g$.,$ the, and$)$ occur repeatedly throughout the plaintext.

They are readily breakable by frequency analysis techniques.

They are only breakable if the encoded message is extremely large $($on the order of tens or even hundreds of thousands of words$).$

They are only breakable if one can find repeated groups of semantically$-$related terms, usually found in predictable positions.

They are unbreakable, because for any ciphertext, all plaintexts of the same length are possible and equally likely.