✨ Range Chaum-Pedersen proofs are needed to efficiently support cumulative voting

### Is there an existing issue for this?

- [X] I have searched the existing issues

### Suggestion

Toward the initial goal of supporting cumulative voting, **range Chaum-Pedersen proofs** (encrypted plaintext is one of 0, 1, ..., or limit) generalize disjunctive Chaum-Pedersen proofs. When range Chaum-Pedersen proofs are used for both selection encryption limits and contest limits (replacing constant Chaum-Pedersen proofs there), they render **placeholder selections unnecessary** and in turn are more efficient (fewer exponentiations required for ballot encryption of all contest types, not just cumulative voting; submitted file size reduction).

### Possible Implementation

Proof components will generalize to lists/arrays and eradicate the hard-coded zero- and one- proof components. Placeholder selections and their infrastructure will be removed.

The nuance between votes allowed for a particular selection and votes allowed across a contest (in sum) will be reflected in the code; meanwhile, this can amend the current conflation between `number_elected` and `votes_allowed`.

### Anything else?

See this [pull request](https://github.com/microsoft/electionguard/pull/293) with the corresponding schema changes.

首先查看 pull request #293 及其對應的 schema 變更，然後追蹤現有的析取式與常數 Chaum-Pedersen 證明元件。實作應將證明元件泛化為列表或陣列，移除佔位選擇及其基礎設施，並區分每個選擇的限制與整個競賽的投票限制。確認累積投票和其他競賽類型能夠有效率地使用新的範圍證明。

由索引模型根據 Issue 內容生成。