Answer:
Algorithm
Start
Int n // To represent the number of array
Input n
Int countsearch = 0
float search
Float [] numbers // To represent an array of non decreasing number
// Input array elements but first Initialise a counter element
Int count = 0, digit
Do
// Check if element to be inserted is the first element
If(count == 0) Then
Input numbers[count]
Else
lbl: Input digit
If(digit > numbers[count-1]) then
numbers[count] = digit
Else
Output "Number must be greater than the previous number"
Goto lbl
Endif
Endif
count = count + 1
While(count<n)
count = 0
// Input element to count
input search
// Begin searching and counting
Do
if(numbers [count] == search)
countsearch = countsearch+1;
End if
While (count < n)
Output count
Program to illustrate the above
// Written in C++
// Comments are used for explanatory purpose
#include<iostream>
using namespace std;
int main()
{
// Variable declaration
float [] numbers;
int n, count;
float num, searchdigit;
cout<<"Number of array elements: ";
cin>> n;
// Enter array element
for(int I = 0; I<n;I++)
{
if(I == 0)
{
cin>>numbers [0]
}
else
{
lbl: cin>>num;
if(num >= numbers [I])
{
numbers [I] = num;
}
else
{
goto lbl;
}
}
// Search for a particular number
int search;
cin>>searchdigit;
for(int I = 0; I<n; I++)
{
if(numbers[I] == searchdigit
search++
}
}
// Print result
cout<<search;
return 0;
}
You find the slope of the line by using the formula 
where x1 and y1 is the first point, and x2 and y2 are the second point.
2 have solutionsof each way if
1/4 squared would be 1/4 times 1/4 which would eqaul 0.063
Answer:
Q.1.
Sum of angles of a triangle = 180°
∠A + ∠B + ∠c = 180
(3x - 9) + (4x + 15) + 90 = 180
3x - 9 + 4x + 15 + 90 = 180
7x + 96 = 180
7x = 84
x = 12
∠A = 3x - 9 = 3(12) - 9 = 36 - 9 = 27°
∠B = 4x + 15 = 4(12) + 15 = 48 + 15 = 63°
∠A = 27°
∠B = 63°
Q.2.
x = 14
y = 60°
