typedef struct point Point;

    struct point {
      double x;
      double y;
    };

• For each of these two representations, write a function which, given two points p and q, returns the distance between them.

      double distA( double p[2], double q[2] );
  
      double distS( Point p, Point q );
  

  Recall that the formula for the distance between 2 points is

  distance =  sqrt ((x2-x1)^2 + (y2-y1)^2)
  

  Do you find one version of the function "easier to read" than the other?

• Using the struct representation, write a function that reads in points from standard input and stores them in an array. It should return how many points it successfully read in. We will assume points are read in as pairs of integers separated by spaces and/or newlines.

  It should have the following prototype

  int readPoints(Point points[], int maxPoints);
  

• Write a function to print out an array of points. Print them out to 1 decimal place and in this format (4.5,9.0)

• Write a program that uses these 2 functions to read in a maximum of 100 points and print them out again.

• Write a function furthestFromOrigin that finds and returns the point in the array that is furthest from the origin. You can use your distS function from earlier.

#define MAX_PLATE
typedef struct parkingFine ParkingFine;
struct parkingFine{
    double amount;
    char numberPlate[MAX_PLATE];
};


int readParkingFine ( ParkingFine fine );

int main(void){
    ParkingFine f;
    if(readParkingFine(f)){
        printf("%lf %s\n",f.amount, f.numberPlate);
    } else {
        fprintf(stderr,"Invalid Input\n");
        return EXIT_FAILURE;
    }
    return EXIT_SUCCESS;
}

// Returns 1 if valid input was read in
// Returns 0 otherwise
int readParkingFine ( ParkingFine fine ){
    if ( scanf("%lf",&fine.amount) != 1 ||
         fgets(fine.numberPlate,MAX_PLATE,stdin) == NULL){
        return 0;
    } else {
        return 1;
    }
}

#define MAX_LEN 100

typedef struct student Student;

struct student{
    int zid;
    char name[MAX_LEN];
}

 Student * findStudent(Student class[], int size, int zid);