Q21Single correct5 Marks3 Sep 2023

A word is said to be perfect if no letter is repeated. Let isPerfect be a procedure that takes a row $X$ from the "Words" table as input and decides whether the word is perfect. Choose the correct implementation of the procedure isPerfect.

A

``` Procedure isPerfect(X) C = [] i = 1 flag = True while(i <= X.LetterCount){ A = ith letter in X.Word if(member(C, A)){ flag = False } else{ C = C ++ [A] flag = True } i = i + 1 } return(flag) End isPerfect ```

B

``` Procedure isPerfect(X) C = [] i = 1 flag = True while(i <= X.LetterCount){ A = ith letter in X.Word if(member(C, A)){ flag = False exitloop } C = C ++ [A] i = i + 1 } return(flag) End isPerfect ```

C

``` Procedure isPerfect(X) C = [] i = 1 flag = True while(i <= X.LetterCount){ A = ith letter in X.Word if(member(C, A)){ flag = False exitloop } else{ C = C ++ [A] } i = i + 1 } return(flag) End isPerfect ```

D

``` Procedure isPerfect(X) C = [] i = 1 flag = True while(i <= X.LetterCount){ A = ith letter in X.Word if(member(C, A)){ exitloop } C = C ++ [A] i = i + 1 } return(flag) End isPerfect ```