Since, it is "sequential search" here "unsuccessful Search" means it should search(go through) for every element in the symbol table,
so,
given L is the length of the symbol table.
then,
for Unsuccessful search,
it is,
L no.of comparisons required on average.
so, it is = L.