Well, i later talked to guys from another site and they recommended i stop using simply Fortran and try QB64, watched videos on it and behold, i became a victor. Here is the solution Using QBasic. ENJOY!
CLS
i = 1: po = 0.95: tol = 10 ^ -6: no = 20: CONST pi = 4 * ATN1
PRINT , , " "; "COURSE CODE ASSIGNMENT"
PRINT , " "; "By CANDIDATE NAME"
PRINT "i", "po", "p", "ABS(p-po)"
2 IF i < no THEN
p = po - SIN(pi * po)
PRINT i,
PRINT po,
PRINT p,
PRINT ABS(p - po)
IF ABS(p - po) < tol THEN
PRINT (p); "Procedure completed successfully"
END IF
i = i + 1: po = p
GOTO 2
ELSE
PRINT "method failed after 20 iterations*"
END IF