[JAVA: Data and Algorithms ]

Basically the practice question is : write the correct find using bolean if datum is there. Essentially means writing a bolean code that finds if datum is there

Heres the code

Here is page 1

Here is page 2

I already competed part of the solution I think(its inside the black circle)

I appreciate any help on this practice question thanks

public static int Find(int al).int size, int datum) int i-0; while (datum ! alil) && (i l-size)) I if (i--size) ( return -1; ) else return i; public static int Find(String allint size, String datum) ( int i-0; while ((datum.equals( al)&& (i l-size) if (i:# size) { return -1; ) else ( return i; public static int enterAtBeginning/String alL int size,String datum) int i; for (i-size; ibo; i-X alil-ali-1]: a[0]-datum; size++ return size; public static int enterAtEnd(String all.int size,String datum) f a[size]-datum; size++ return size