1. Find out given string is palindrome or not with out using predefined methods. 2. Find out first and last index of given search element in integer array. Ex : int arr[]={2,1,3,3,3,3,3,4,5,6}, searchElem=3, out put is 2,6. 3. Arrange given words array as per alphabetical alpha[] order. Ex: alpha={d,f,g,h,j,k,l,w,a,x,c,v,b,n,m,w,e,r,t,y,u,i,o,p,z} words={"alpha","zoo","office","delete"} output ={"delete","alpha","office","zoo"}