<prompt> Kutokana na safu n ya n nambari ambapo numsi ni katika mbalimbali 1, n, kurudi safu ya idadi zote katika mbalimbali 1, n kwamba hawana kuonekana katika nums.  <response>: One solution would be to iterate over the array and mark each number in a separate boolean array of size n1 as seen. Finally, iterate over the boolean array and add all the indices with false value to the result array.Here is the code for this approach:public List findDisappearedNumbersint nums List result new ArrayList; boolean seen new booleannums.length1; for int num : nums seennum true; for int i 1; i seen.length; i if !seeni result.addi; return result;This solution has a time complexity of On and a space complexity of On. 