Q15Single correct6 Marks28 Apr 2024

We call two sentences similar if both of them have the same number of words and satisfy the following conditions: • The $i^{th}$ word in the first sentence has the same part of speech as the $i^{th}$ word in the second sentence, for $1 \le i \le \text{length}(aList)$, where L is the total number of words in either sentence. • aList and bList are lists that contain the part of speech of words in two sentences A and B respectively. • isSimilar is a procedure that accepts these two lists as parameters and checks for the similarity of A and B. Choose the correct implementation of the procedure isSimilar.

A

``` Procedure isSimilar(aList, bList) if(length(aList) != length(bList)){ return(False) } cList = bList foreach x in aList{ if(x != first(cList)){ return(False) } cList = rest(cList) } return(True) End isSimilar ```

B

``` Procedure isSimilar(aList, bList) if(length(aList) != length(bList)){ return(False) } cList = bList foreach x in aList{ if(x == first(cList)){ return(False) } cList = rest(cList) } return(True) End isSimilar ```

C

``` Procedure isSimilar(aList, bList) if(length(aList) != length(bList)){ return(False) } cList = bList foreach x in aList{ if(x != first(cList)){ return(True) } cList = rest(cList) } return(False) End isSimilar ```

D

``` Procedure isSimilar(aList, bList) if(length(aList) != length(bList)){ return(False) } cList = bList foreach x in aList{ if(x != last(cList)){ return(False) } cList = init(cList) } return(True) End isSimilar ``` ————————————————————————————————————————————————————————————