Consider the following set of processes: process burst time arrival time priority start wait finish ta p1 15 4 10 2 p2 5 15 p3 10 20 3 p4 5 25 1 (highest) draw the gnatt chart that illustrates the execution of these processes using the following scheduling algorithms: fcfs, sjf, srtf, non-preemptive priority, preemptive priority, rr (quantum 4) average waiting time: average turn-around time:

The purpose of this problem is to write some small functions and practice passing things around amoung functions.1) the main function shall ask the user to enter three numbers and read the three numbers.2) write a function named findsum that takes three numbers as arguments and returns their sum. the main function shall call this function.3) write a function named findaverage that takes the sum and the number of numbers and returns the average. the main function shall call this function.4) write a function named findsmallest that takes the three numbers and returns the smallest value. the main function shall call this function.5) the main function shall print the results in the following format, with two decimal positions and the decimal points aligned: