Arrange the following stages of dispute resolution in a Gram Kutchery under the Bihar Panchayati Raj Act, 2006, in the correct sequential order (from the initiation of the dispute to its final disposal): 1. Filing of the petition/suit before the Sarpanch. 2. Constitution of a Bench of the Gram Kutchery consisting of two Panchs nominated by parties, two Panchs nominated by Sarpanch, and the Sarpanch/Panch presiding. 3. Attempting amicable settlement/compromise between the parties. 4. Pronouncement of the final decision/decree by the Bench of Gram Kutchery. Select the correct answer using the codes given below:

Options:

• A: 1-2-3-4
• B: 2-1-3-4
• C: 1-3-2-4
• D: 2-3-1-4

Related Practice Questions:

• Let $S_1$ and $S_2$ be two disjoint, non-empty convex sets in $\mathbb{R}^n$. Under which of the following conditions is there guaranteed to exist a hyperplane that strictly separates $S_1$ and $S_2$?
• Let the primal linear programming problem be: Maximize $Z = c^T x$ subject to $Ax \le b, x \ge 0$. If this primal problem has an unbounded optimal objective value, then which of the following statements is always true regarding its dual problem?
• Let $S = \{(x, y) \in \mathbb{R}^2 \mid x^2 + y^2 \le 9\}$ be a convex set in $\mathbb{R}^2$. The set of all extreme points of $S$ is given by:
• In a linear programming problem with $3$ independent equality constraints and $5$ variables (including slack/surplus variables), what is the maximum possible number of basic solutions?