Can you help me with the time complexity of this solution for finding symmetrical differences problem and explain in detail including the case where there are more than two input arrays.

https://www.freecodecamp.org/learn/coding-interview-prep/algorithms/find-the-symmetric-difference

```
let symmetricDiffTwoArray=(firstArray,secondArray)=>{
let resultArray=[];
for(let i=0;i<firstArray.length;i++){
let currentElement=firstArray[i];
if(resultArray.indexOf(currentElement) === -1 && secondArray.indexOf(currentElement) === -1)
resultArray.push(currentElement);
}
for(let j=0;j<secondArray.length;j++){
let currentElement=secondArray[j];
if(resultArray.indexOf(currentElement) === -1 && firstArray.indexOf(currentElement) === -1)
resultArray.push(currentElement);
}
return resultArray;
}
function sym(...args) {
let symmetricDiff=args.reduce(symmetricDiffTwoArray,[]);
return symmetricDiff;
}
console.log(sym([1, 2, 3], [5, 2, 1, 4],[7,4]));
```