Solution A

Solution B

function reverse$\_$word$($string word$)$

reversed $={?}^i$

for letter in word: reversed $=$ letter $+$ reversed

return reversed

function check$\_$all$\_$palindromes$($array arr$)$

if arr$[0]==$ reverse$\_$ word$($arr $[0]$

if arr$[1]==$ reverse$\_$word$($arr$[1])$

if arr$[2]==$ reverse$\_$word$($arr$[2])$ return true

return false

function reverse$\_$word$($string word$)$ reversed $={?}^n$

for letter in word:

reversed $=$ letter $+$ reversed

return reversed

function is$\_$palindrome$($string word$)$ return word $==$ reverse$\_$word$($word$)$

function check$\_$all$\_$palindromes$($array arr$)$ for word in arr:

if is$\_$palindrome$($word$)==$ false return false

return true

Solution C $$0\mathrm{.}00$

function reverse$\_$word$($string word$)$

reversed $=""$

for letter in word:

reversed $=$ letter $+$ reversed

return reversed

function check$\_$all$\_$palindromes$($array arr$)$

reversed $1=$ reverse$\_$word$($word $1)$

reversed$2=$ reverse$\_$word word $2)$

reversed$3=$ reverse$\_$word word $3)$

if arr$[0]$ does not equal reversed $1$ :

return false

if arr$[1]$ does not equal reversed$2$: return false

if arr$[2]$ does not equal reversed$3$: return false

return true

Question:

Out of the three above solutions, which one best adheres to good programming practices and principles?

Solution A most closely follows programming best practices and principles

Solution B most closely follows programming best practices and principles

Solution C most closely follows programming best practices and principles

All three solutions do an equally good job following programming best practices and principles