Suppose, you are given the coordinates of bottom-left and top-right corners of a rectangle as input-1, R i.e R=[Bottom-left corner co-ordinate; Top-Right corner coordinate]. And you are told to count the points of the input-2, P (which represents multiple points a,b,c,d, etc within a matrix i.e P=[a;b;c;d]) lie within the rectangle, R and how many are not. Show them collectively within an output matrix, Y.

Example: Inputs: R=[0 0;10 8], P=[1 5;-1 5] Output: Y=[1 1];