title: find elements from an array such that no two are adjacent and whose sum is maximum
body: <p>Find a sequence containing elements of given array such that no two elements are adjacent and we are required to maximise the sum of the sequence formed.</p>
  
  <p>input :- { 4 , 1 , 3 , 4 }</p>
  
  <p>output :- 4 4</p>