Design and analyze an exhaustive$-$search algorithm for the following problem:

INPUT: an array $A[0,$dots,$n-1]$ of real values, and a target real value $t$

OUTPUT: TRUE iff there are three indices $A[i]+A[j]+A[k]=ti$ such that $A[i]+A[j]+A[k]=t.$