Following are two functions to find the largest of the 4 given numbers. Which of these has better time complexity? Justify your answer. (5 Marks) int findLargest1(in a, int b, int c, int d) { int lrg = a; if(b>lrg) lrg=b; else if(c>lrg) lrg=c; else if(d>lrg) lrg=d; return lrg; } int findLargest2(in a, int b, int c, int d) { if(a>b) if(a>c) if(a>d) retrun a; else return d; else if(c>d) return c; else return d; else if(b>c) if(b>d) return b; else return d; else if(c>d) return c; else return d; }

int findLargesti(in a, int b, int c, int d) { int lrg = a; if (b>lrg) lrg=b; else if (c>lrg) lrg=c; else if (d>lrg) lrg=d; return lrg; } int findLargest2 (in a, int b, int c, int d) { if(a>b) if(a>c) if (a>d) retrun a; else return d; else if(c>d) return c; else return d; else if(b>c) if (b>d) return b; else return d; else if (c>d) return c; else return d; }