Which of the following algorithms is correct for applying linear search to find the element findEle in a list StudentIDs?

a) LinearSearch(StudentIDs, int listSize, int findEle) { for (ctr = 1; i < listSize; ctr++) { if (StudentIDs[ctr] == listSize) return ctr } }

b) LinearSearch(StudentIDs, int listSize, int findEle) { for (ctr = 0; i < listSize; ++ctr) { if (StudentIDs[listSize] == ctr) return findEle } }

c) LinearSearch(StudentIDs, int listSize, int findEle) { for (ctr = 0; i < listSize; ++ctr) { if (StudentIDs[ctr] == findEle) return ctr } }

d) LinearSearch(StudentIDs, int listSize, int findEle) { for (ctr = 0; i < listSize; ++ctr) { if (StudentIDs[findEle] == ctr) return findEle } }