The given code is for Palindrome Program,

Given the following test cases:

$t1=$ word $=AA,$EOP$=$ true $>$

$t2=$ word $=$ABA, EOP$=$true $>$

$t3=$ word$=AB,$ EOP$=$false $>$

$t4=$ word$=$ABBADAAD, EOP$=$false $>$

Answer the following questions:

a$)$ How many paths in this code?

b$)$ What are they?

c$)$ Is T adequate for testing the palindrome program using LCSAJ