Let A$[1..$n$]$ be an unsorted array of n integers. Please describe in psuedo$-$code an O$($n$^2$ log n$)$ worst case time algorithm to decide whether there are four numbers $($some of them could be the same$)$ a$,$ b$,$ c$,$ d

in the array such that a $+6+$ c $+$ d $=100.($Hint: you can directly call

MergeSort to sort an array of k integers in worst$-$case O$($k log k$)$ time.$)$